Buscar
Mostrando ítems 1-10 de 134
Edge-colouring of join graphs
(Elsevier Science BvAmsterdamHolanda, 2006)
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 ...
On quantum perfect state transfer in weighted join graphs
(2009-09-02)
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators
Spectra of graphs obtained by a generalization of the join graph operation
(ELSEVIER SCIENCE BV, 2013)
Grundy dominating sequences on X-join product
(Elsevier Science, 2020-09)
In this paper we study the Grundy domination number on the X-join product G↩R of a graph G and a family of graphs R={Gv:v∈V(G)}. The results led us to extend the few known families of graphs where this parameter can be ...
Characterizations of Postman Sets
(Elsevier Science B. V., 2004-12)
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eulerian graphs. We study the relationship ...
Characterizations of postman sets
(Elsevier Science, 2008-06)
Using results by McKee and Woodall on binary matroids, we show that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eulerian graphs. We study the relationship ...
Generalized limited packings of some graphs with a limited number of P4-partners
(Elsevier Science, 2015-05)
By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes ...