Results 101 to 110 of about 990 (211)
Cycling properties of circulant graphs
, 2022 Tato práce se věnuje cyklickým vlastnostem cirkulačních grafů. Především je zaměřena na pancyklicitu cirkulantů. Mějme dána kladná celá čísla 0 < a_1 < a_2 < ... < a_k
Rečková, Alena
core
Restricted triangulation on circulant graphs
Open Mathematics, 2018 The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C(n, S) be a circulant graph on n vertices with jump value set
Ali Niran Abbas +2 more
doaj +1 more source
Minimum chromaticity of circulant graphs
, 2005 We determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic number χ(G)⩽3. In particular, we show that there exists an n0 such that χ(G)⩽3 for all n⩾n0 whenever S={s1,s2,…,sk} and sk>sk-1>⋯>s1 and 2s1>sk or S={s1,s2} and s2>s1 ...
Peters, Joseph +2 more
core +1 more source
Frobenius circulant graphs of valency four [PDF]
, 2008 © 2008 Australian Mathematical Society. Online edition of the journal is available at http://journals.cambridge.org/JAZAbstract A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that
Thomson, A, Zhou, S
core +1 more source
Total colorings of some classes of four regular circulant graphs
AKCE International Journal of Graphs and CombinatoricsThe total chromatic number, [Formula: see text] is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, [Formula:
R. Navaneeth +3 more
doaj +1 more source
Circulant Graphs And Spherical Codes
, 2015 Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing.
Muniz M. +3 more
core +1 more source
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati +3 more
doaj +1 more source
Strong regularity and circulant graphs
Discrete Mathematics, 1989 Let p be a prime number. The paper characterizes a strong regular \(p^ k\)-circulant graph. Also, the paper gives a representation of Paley graphs of order \(p^ 2\). Specifically, it is shown that a \(p^ k\)- circulant graph is a nontrivial strongly regular graph if and only if \(k=1\) and it is isomorphic to the Paley graph of order p.
openaire +2 more sources
On the metric dimension of circulant graphs
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Imran 0006 +3 more
openaire +1 more source
Further studies on circulant completion of graphs
A circulant graph C(n,S) is a graph having its adjacency matrix as a circulant matrix. It can also be intrepreted as a graph with vertices v0,v1,...,vn-1 that are in one to one correspondence with the members of Zn and with edge set {vivj:i-j ∈ S}, where
Antony, Tony, Naduvath, Sudev
core +1 more source