Graphs which are switching equivalent to their line graphs.
D.M. Cvetkovic, S.K. Simic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
D.M. Cvetkovic, S.K. Simic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Jin Akiyama, Kimiko Kaneko, Slobodan Simić (1978)
Publications de l'Institut Mathématique
Similarity:
Dragoš M. Cvetković (1980)
Publications de l'Institut Mathématique
Similarity:
R. Sokarovski (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Slobodan K. Simić (1978)
Publications de l'Institut Mathématique
Similarity:
D. Cvetkovic (1975)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
D.M. Cvetkovic, I. Gutman (1974)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Ivan Gutman (1980)
Publications de l'Institut Mathématique
Similarity:
Dragoš M. Cvetković, Slobodan K. Simić (1974)
Publications de l'Institut Mathématique
Similarity:
Simić, Slobodan K. (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Slobodan K. Simić (1980)
Publications de l'Institut Mathématique
Similarity:
Amanda Niedzialomski (2016)
Discussiones Mathematicae Graph Theory
Similarity:
For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G). In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G)|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio...
Sandi Klavžar, Matjaz Kovse (2007)
Discussiones Mathematicae Graph Theory
Similarity:
The Θ-graph Θ(G) of a partial cube G is the intersection graph of the equivalence classes of the Djoković-Winkler relation. Θ-graphs that are 2-connected, trees, or complete graphs are characterized. In particular, Θ(G) is complete if and only if G can be obtained from K₁ by a sequence of (newly introduced) dense expansions. Θ-graphs are also compared with familiar concepts of crossing graphs and τ-graphs.
Akiyama, Jin, Harary, Frank (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)
Discussiones Mathematicae Graph Theory
Similarity:
Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
Marián Klešč, Stefan Schrötter (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87-97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained as join product of two graphs. In the paper, the exact values of crossing...