Characterizations of m-connected graphs
A. Idzik (1987)
Applicationes Mathematicae
Similarity:
A. Idzik (1987)
Applicationes Mathematicae
Similarity:
Mirko Lepović (1993)
Publications de l'Institut Mathématique
Similarity:
Frank, András (1998)
Documenta Mathematica
Similarity:
Liskovets, Valery A. (2000)
Journal of Integer Sequences [electronic only]
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
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.
Alina Szelecka, Andrzej Włoch (1996)
Discussiones Mathematicae Graph Theory
Similarity:
Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic...
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity: