Graphs with greatest number of matchings.
I. Gutman (1980)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
I. Gutman (1980)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
A. Gyárfás (1987)
Applicationes Mathematicae
Similarity:
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...
Van Bang Le (2000)
Discussiones Mathematicae Graph Theory
Similarity:
Andrzej Włoch (1999)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we propose a generalization of well known kinds of perfectness of graphs in terms of distances between vertices. We introduce generalizations of α-perfect, χ-perfect, strongly perfect graphs and we establish the relations between them. Moreover, we give sufficient conditions for graphs to be perfect in generalized sense. Other generalizations of perfectness are given in papers [3] and [7].
Igor' E. Zverovich, Olga I. Zverovich (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.
Barik, S., Nath, M., Pati, S., Sarma, B.K. (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Magda Dettlaff, Magdalena Lemańska, Gabriel Semanišin, Rita Zuazua (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k ≥ 2. Moreover, we provide a complete characterisation of (ψ2 − γ1)- perfect graphs describing the set of its forbidden induced subgraphs and providing the explicit characterisation of the structure...