Opening book details…
Can I read Induced Matching Extendable Graphs on EtoBox?
Induced Matching Extendable Graphs by Jinjiang, Yuan is a Computer Science article available to read on EtoBox.
What is Induced Matching Extendable Graphs about?
We say that a simple graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. The main results of this paper are as follows: (1) For every connected IM-extendable graph 2 |V (G)| -2; the equality holds if and only if G ∼ = T × K 2 , where T is a tree. (3) The only 3-regular connected IM-extendable graphs are C n × K 2 , for n ≥ 3, and C 2n (1, n), for n ≥ 2, where C 2n (1, n) is the graph with 2n vertices x 0 , x 1 , . . . , x 2n-1 , such that x i x j is an edge of C 2n (1, n) if either |i -j| ≡ 1 (mod 2n) or |i -j| ≡ n (mod 2n).
Who reads Induced Matching Extendable Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Jinjiang, Yuan
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 1998
- Language
- EN
- Field
- Computer Science (Physical Sciences)