𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs isomorphic to their maximum matching graphs

✍ Scribed by Yan Liu; Gui Ying Yan

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2009
Tongue
English
Weight
378 KB
Volume
25
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs isomorphic to subgraphs of their
Graphs isomorphic to subgraphs of their line-graphs
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 621 KB

## An emhdding of graph G into graph N is by definition an isomorphism OI G onto a subgraph of H. It is shown in this paper that every unicycle V embeds in its line-graph L(V), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle

Maximum induced matchings in graphs
Maximum induced matchings in graphs
✍ Jiping Liu; Huishan Zhou πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 218 KB

We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.

Reductions to Graph Isomorphism
Reductions to Graph Isomorphism
✍ Jacobo TorΓ‘n πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 382 KB
Z-transformation graphs of maximum match
Z-transformation graphs of maximum matchings of plane bipartite graphs
✍ Heping Zhang; Rijun Zha; Haiyuan Yao πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 462 KB

Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z(G) on the maximum matchings of G are deΓΏned. If G has a perfect matching, Z(G) and Z(G) are the usual Z-transformation graph and digraph. If G has neither isolated vertices nor perfect matching, then Z(G) is not