Graphs with prescribed size and vertex parities
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
Yong Wang, Xueliang Li, Ivan Gutman (2001)
Publications de l'Institut Mathématique
Similarity:
Vladimír Baláž, Jaroslav Koča, Vladimír Kvasnička, Milan Sekanina (1986)
Časopis pro pěstování matematiky
Similarity:
Petrović, Miroslav M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.
Dragoš Cvetković, Tatjana Davidović (2009)
Zbornik Radova
Similarity:
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity: