Name
Abstract | ||
|---|---|---|
The second kind maximum matching graphM"2(G) of a graph G is the graph whose vertices are the maximum matchings of G such that two vertices M"1 and M"2 of M"2(G) are adjacent if and only if the symmetric difference of M"1 and M"2 induces either a cycle or a path of length 2. In this paper, we prove that the class of second kind maximum matching graphs has no forbidden induced subgraphs, and we characterize the graphs whose second kind maximum matching graphs are trees, or cycles, or complete graphs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.disc.2014.01.011 | Discrete Mathematics |
Keywords | Field | DocType |
vertices m,kind maximum,graph g,induced subgraphs,symmetric difference,complete graph,maximum matchings,maximum matching | Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Bipartite graph,Cograph,Factor-critical graph,Pathwidth,1-planar graph,Mathematics,Split graph | Journal |
Volume | ISSN | Citations |
323 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Liu | 1 | 197 | 30.85 |
| Zhengbiao Liu | 2 | 0 | 0.34 |