Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Rainbow Tetrahedra in Cayley Graphs”
Extension of strongly regular graphs.
On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Magic and supermagic dense bipartite graphs
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.
Multiprocessor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity:
Proper Connection Of Direct Products
Richard H. Hammack, Dewey T. Taylor (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The proper connection number of a graph is the least integer k for which the graph has an edge coloring with k colors, with the property that any two vertices are joined by a properly colored path. We prove that given two connected non-bipartite graphs, one of which is (vertex) 2-connected, the proper connection number of their direct product is 2.
The number of labeled 2-connected planar graphs.
Bender, Edward A., Gao, Zhicheng, Wormald, Nicholas C. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremely Irregular Graphs
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
Precoloring extension. II. Graphs classes related to bipartite graphs.
Hujter, M., Tuza, Zs. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Ramseyan properties of graphs.
DeLaVina, Ermelinda, Fajtlowicz, Siemion (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Integral quartic Cayley graphs on Abelian groups.
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Note on Strong Product of Graphs
M. Tavakoli, F. Rahbarnia, A. R. Ashrafi (2013)
Kragujevac Journal of Mathematics
Similarity:
All Ramsey numbers for connected graphs of order 9.
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multiprocesor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2009)
Zbornik Radova
Similarity:
Graphs with prescribed size and vertex parities
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
On Generalized Sierpiński Graphs
Juan Alberto Rodríguez-Velázquez, Erick David Rodríguez-Bazan, Alejandro Estrada-Moreno (2017)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.