Search
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
Abstract
Given two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover, we give conditions on a graph to have equalities between these three parameters.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (3)
-
Sergio Bermudo
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
DISCRETE APPLIED MATHEMATICS
no. 304,
pages 153 - 163,
ISSN: 0166-218X - Language:
- English
- Publication year:
- 2021
- Bibliographic description:
- Bermudo S., Dettlaff M., Lemańska M.: Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number// DISCRETE APPLIED MATHEMATICS -Vol. 304, (2021), s.153-163
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2021.07.034
- Verified by:
- Gdańsk University of Technology
seen 110 times
Recommended for you
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
- M. Lemańska,
- J. A. RODRíGUEZ-VELáZQUEZ,
- R. Trujillo-Rasua
2017