Results 161 to 170 of about 332 (178)

The Kirchhoff Indices for Circulant Graphs

Siberian Mathematical Journal
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. D. Mednykh, I. A. Mednykh
openaire   +1 more source

On the Ádám Conjecture on Circulant Graphs

1998
In this paper we study isomorphism between circulant graphs. Such graphs have a vast number of applications to telecommunication network, VLSI design and distributed computation [4,13,15,17]. By suitably choosing the length of the chord between two nodes of the network, one can achieve the appropriate property: e.g., low diameter, high connectivity, or
Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski   +2 more
openaire   +1 more source

Kernel in Oriented Circulant Graphs

2009
A kernel in a directed graph D(V,E) is a set S of vertices of D such that no two vertices in S are adjacent and for every vertex u in $V\smallsetminus S$ there is a vertex v in S , such that (u,v) is an arc of D. The problem of existence of a kernel is NP-complete for a general digraph.
Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha   +3 more
openaire   +1 more source

Self-complementary circulant graphs

Ars Comb., 1999
Summary: There exists a self-complementary circulant graph with \(n\) vertices if and only if every prime \(p\) in the prime factorization of \(n\) satisfies \(p \equiv 1\) (mod 4).
Brian Alspach, Joy Morris, V. Vilfred
openaire   +1 more source

Pancyclicity of connected circulant graphs

Journal of Graph Theory, 1996
The following results are shown for connected circulant graphs \(G\): (1) If \(G\) has at least two jumps, then every edge of \(G\) lies in a cycle of each even length \(i, i\geq 4\). (2) If the smallest cycle of \(G\) is a triangle, then \(G\) is pancyclic. To show these results, cycles of the specified lengths are all explicitly given.
openaire   +2 more sources

Splitting fields of spectra of circulant graphs

Journal of Algebra, 2022
Katja Monius
exaly  

The algebraic degree of spectra of circulant graphs

Journal of Number Theory, 2020
Katja Monius
exaly  

Efficient domination in circulant graphs

Discrete Mathematics, 2013
Gary Macgillivray
exaly  

Some classes of integral circulant graphs either allowing or not allowing perfect state transfer

Applied Mathematics Letters, 2009
Marko Petković
exaly  

On the chromatic number of integral circulant graphs

Computers and Mathematics With Applications, 2010
Aleksandar Ilić
exaly