惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

PCI Perspectives
PCI Perspectives
博
博客园 - Franky
M
MIT News - Artificial intelligence
B
Blog
P
Privacy International News Feed
T
The Exploit Database - CXSecurity.com
F
Full Disclosure
The Register - Security
The Register - Security
P
Proofpoint News Feed
T
Threat Research - Cisco Blogs
腾
腾讯CDC
Project Zero
Project Zero
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
T
Threatpost
人人都是产品经理
人人都是产品经理
Last Week in AI
Last Week in AI
Hugging Face - Blog
Hugging Face - Blog
Simon Willison's Weblog
Simon Willison's Weblog
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
Know Your Adversary
Know Your Adversary
Vercel News
Vercel News
C
CXSECURITY Database RSS Feed - CXSecurity.com
P
Privacy & Cybersecurity Law Blog
Cyberwarzone
Cyberwarzone
罗
罗磊的独立博客
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
S
Schneier on Security
月光博客
月光博客
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog RSS Feed
IT之家
IT之家
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
V
V2EX
T
The Blog of Author Tim Ferriss
P
Palo Alto Networks Blog
Google DeepMind News
Google DeepMind News
Apple Machine Learning Research
Apple Machine Learning Research
Scott Helme
Scott Helme
Recorded Future
Recorded Future
A
About on SuperTechFans
博
博客园 - 【当耐特】
H
Help Net Security
宝玉的分享
宝玉的分享
C
CERT Recently Published Vulnerability Notes
D
DataBreaches.Net
美
美团技术团队
T
Tenable Blog
C
Cybersecurity and Infrastructure Security Agency CISA
雷峰网
雷峰网
V
Vulnerabilities – Threatpost

math.CO updates on arXiv.org

A complete solution to the biased Alon-Krivelevich-Spencer-Szabó criterion problem for the discrepancy game Scaffolds for Higher Tropical Grassmannians: Foundations Krahn-Szegő type inequalities for graphs $\boldsymbol{2}$-Neighbor Bootstrap Percolation on Odd Graphs Modular inequalities and Alexander polynomials of pencil type conic-line arrangements Counterexamples regarding elementary symmetric partitions Bounds on Multiple $b$-Burst Deletion-Correcting Codes The mex statistic on combinatorial structures Proper Additive Edge Colorings of Regular Graphs Off-diagonal Ramsey numbers Semi-inducibility of 4-vertex graphs Recursions, Trains, Trees, and Combinatorial Rod Set Algebra Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs On the characterizations of $\mathcal{D}_{k} \backslash \mathcal{D}_{k-2}$ Ramsey numbers for 1-degenerate 3-graphs Bipartite graphs with minimum degree at least 15 are antimagic A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs Bounds on the game isolation number and exact values for paths and cycles Minors of non-hamiltonian polyhedra and the Herschel family Triangle-free subsets of the $r$-distance graph of the hypercube Notes on sum-free sets in abelian groups When are Hopf algebras determined by integer sequences? A note on the irrationality of $ζ_2(5)$ Support-sensitive bounds for shortest zero-sum subsequences Weighted Random Dot Product Graphs More efficient sifting for grid norms, and applications to multiparty communication complexity Ordered Yao graphs: maximum degree, edge density, and clique numbers Refined enumeration of planar Eulerian orientations Real algebraic surfaces biholomorphically equivalent but not algebraically equivalent Bubble sort and Howe duality for staircase matrices Self-affine quadrangles On zero-sum Ramsey numbers modulo 3 Covering half-grids with lines and planes Borel Local Lemma: arbitrary random variables and limited exponential growth Dynamic capacity allocation of hybrid transportation units for cargo-hitching in urban public transportation systems An Efficient Genus Algorithm Based on Graph Rotations Neural Networks and (Virtual) Extended Formulations Some conjectures on $r$-graphs and equivalences Pointwise order of generalized Hofstadter functions G, H and beyond On the periodic decompositions of multidimensional configurations A q-analogue of graph independence polynomials with a group-theoretic interpretation Moment-angle manifolds corresponding to three-dimensional simplicial spheres, chordality and connected sums of products of spheres Strong Embeddings of 3-Connected Cubic Planar Graphs on Surfaces of non-negative Euler Characteristic Higher-rank trees arising from polyhedral graphs $L^p$ averages of the Fourier transform in finite fields A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes Open problems on relations of numerical semigroups Alcove walk models for parabolic Mirković-Vilonen intersections and branching to Levi subgroups A Mathematical Reconstruction of Endothelial Cell Networks Matchings in the hypercube with specified edges Geometric planted matchings beyond the Gaussian model Extensions and Deletions of matroid classes closed under flats String attractors and bi-infinite words Progressive and Rushed Dyck Paths Some results on Kleitman's conjecture Symmetric noncrossing partitions of an annulus with double points On two families of Nekrasov-Okounkov type formulas A remark on certain restricted plane partitions and crystal melting model Lecture hall graphs and the Askey scheme The Partial Partition Complex Generating functions of substitutions Standard Monomials for Positroid Varieties Tiling dense hypergraphs A structural duality for path-decompositions into parts of small radius The grid-minor theorem revisited Sumsets and entropy revisited Structure of cell decompositions in Extremal Szemerédi-Trotter examples Coloring, List Coloring, and Painting Squares of Graphs (and other related problems) Determining a Points Configuration from a Subset of the Pairwise Distances Improved Bounds for Multicovering Hypergraphs Totally Nonnegative Tropical Flags and the Totally Nonnegative Flag Dressian Enumeration of Odd-Dimensional Partitions modulo 4 Principal Specialization of Monomial Symmetric Polynomials and Group Determinants of Cyclic Groups Multidimensional Manhattan Preferences Balancing permuted copies of multigraphs and integer matrices Mixing times of one-sided $k$-transposition shuffles Embeddings of $k$-complexes in $2k$-manifolds and minimum rank of partial symmetric matrices The pre-Pieri rules Synchronization of strongly connected partial DFAs and prefix codes Large rainbow matchings in edge-colored graphs Surface cluster algebra expansion formulae via loop graphs Lattice structure of Weyl groups via representation theory of preprojective algebras A Cambrian framework for the oriented cycle Automorphism Groups of Graphical Models and Lifted Variational Inference Markov Chains on Orbits of Permutation Groups An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem Strong Backdoors to Bounded Treewidth SAT Strong Backdoors to Nested Satisfiability e-Valuate: A Two-player Game on Arithmetic Expressions -- An Update Combinatorial frameworks for cluster algebras Backdoors to Satisfaction Backdoors to Acyclic SAT Confidence-based Reasoning in Stochastic Constraint Programming A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives Palette-colouring: a belief-propagation approach Restructuring in Combinatorial Optimization Speeding up SAT solver by exploring CNF symmetries : Revisited Input Parameters Optimization in Swarm DS-CDMA Multiuser Detectors Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function Sortable Elements for Quivers with Cycles
A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27
Vilfred Kamalappan · 2025-08-13 · via math.CO updates on arXiv.org

This study is the $2^{nd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Definition of Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ was further modified by the author by considering $m > 1$ divides $\gcd(n, r)$, $m^3$ divides $n$ and $r\in R$ and studied Type-2 isomorphic circulant graphs w.r.t. $m$ = 2. This modification simplifies our calculations while finding isomorphic circulant graphs of Type-2. In this paper, using the modified definition \ref{d4.2}, we obtain Type-2 isomorphic circulant graphs of orders 16, 24 and 27 and show that the total number of pairs of Type-2 isomorphic circulant graphs of orders 16 and 24 are 8 and 32, respectively and the total number of triples of Type-2 isomorphic circulant graphs of order 27 are 12.

此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。