A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Displaying similar documents to “Supermagic Generalized Double Graphs 1”
A note on intersecting graphs.
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
A characterization of complete tripartite degree-magic graphs
Ľudmila Bezegová, Jaroslav Ivančo (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called degree-magic if it admits a labelling of the edges by integers 1, 2,..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to (1+ |E(G)|)/2*deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we characterize complete tripartite degree-magic graphs.
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Cospectral graphs on 12 vertices.
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Note On Graphs Representable As Product Graphs
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity: