Buscar
Mostrando ítems 1-10 de 129
Powers of cycles, powers of paths, and distance graphs
(Elsevier Science, 2011-04)
In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers ...
Shifts of the stable Kneser graphs and hom-idempotence
(Academic Press Ltd - Elsevier Science Ltd, 2017-05)
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n≥1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n,k) are ...
Perfect state transfer, integral circulants and join of graphs
(2009-09-04)
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and
the Cartesian product of graphs. We build upon ...
Colouring Clique-Hypergraphs of Circulant Graphs
(Springer Japan KkTokyoJapão, 2013)
Circulant Graphs And Spherical Codes
(, 2006)
A Class of Parametric Regular Networks for Multicomputer Architectures
(Computación y Sistemas, 2009)
A Note On Quadrangular Embedding Of Abelian Cayley Graphs
(Sociedade Brasileira de Matemática Aplicada e Computacional, 2016)
On dominating set polyhedra of circular interval graphs
(Elsevier Science, 2021-04)
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing ...
Circuits and Circulant Minors
(Elsevier, 2019)
Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficient conditions for a circular matrix A to ...