Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Wayne Goddard, Kiran Kanakadandi (2007)
Discussiones Mathematicae Graph Theory
Similarity:
The orientation distance graph 𝓓ₒ(G) of a graph G is defined as the graph whose vertex set is the pair-wise non-isomorphic orientations of G, and two orientations are adjacent iff the reversal of one edge in one orientation produces the other. Orientation distance graphs was introduced by Chartrand et al. in 2001. We provide new results about orientation distance graphs and simpler proofs to existing results, especially with regards to the bipartiteness of orientation distance graphs...
Akiyama, Jin, Harary, Frank (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
C. C. Koung, J. Opatrny (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Abdollah Khodkar, Rui Xu (2007)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction...
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
Similarity: