Results 41 to 50 of about 421,915 (161)
On the average energy of circulant graphs [PDF]
, 2008 We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d.
Blackburn, Simon R. +1 more
core +1 more source
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
Mathematics, 2021 An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a graph G
Josephine Brooks +5 more
doaj +1 more source
On the energy of some circulant graphs [PDF]
, 2005 We give an explicit construction of circulant graphs of very high energy. This construction is based on Gauss sums. We also show the Littlewood conjecture can be used to establish new result for a certain class of circulant ...
Shparlinski, Igor, Igor Shparlinski
core +1 more source
On the Metric Index of Circulant Networks–An Algorithmic Approach
IEEE Access, 2019 A vertex v of a graph G uniquely determines (resolves) a pair (v1, v2) of vertices of G if the distance between v and v1 is different from the distance between v and v2.
Imran Khalid +2 more
doaj +1 more source
Combinatorial refinement on circulant graphs [PDF]
, 2022 The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a low-complexity ...
Kluge, Laurence
core +1 more source
Colouring Clique-Hypergraphs of Circulant Graphs
, 2015 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique of size at least two is ...
Dantas, S, Campos, CN, de Mello, CP
core +1 more source
Perfect matching transitivity of circulant graphs.
Electronic Journal of Graph Theory and Applications, 2022 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v).
Isaac Armando Reiter, Ju Zhou
doaj +1 more source
Two families of circulant nut graphs [PDF]
, 2022 A circulant nut graph is a non-trivial simple graph whose adjacency matrix is a circulant matrix of nullity one such that its non-zero null space vectors have no zero elements.
Damnjanović, Ivan
core +1 more source
Eccentricity-Based Topological Invariants of Some Chemical Graphs
Atoms, 2019 Topological index is an invariant of molecular graphs which correlates the structure with different physical and chemical invariants of the compound like boiling point, chemical reactivity, stability, Kovat’s constant etc.
Nazeran Idrees +2 more
doaj +1 more source
Solitaire clobber on circulant graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pará, Telma +2 more
openaire +1 more source