Name
Abstract | ||
|---|---|---|
A theta graph is denoted by theta(a, b, c), a <= b <= c. It is obtained by subdividing the edges of the multigraph consisting of 3 parallel edges a times, b times and c times each. In this paper, we show that the theta graph is matching unique when a >= 2 or a = 0, and all theta graphs are matching equivalent when only one of the edges is subdivided one time. We also completely characterize the relation between the largest matching root lambda and the length of path a, b, c of a theta graph, and determine the extremal theta graphs. |
Year | DOI | Venue |
|---|---|---|
2012 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Matching Polynomial,Matching equivalent,Matching unique,The largest matching root,Theta graph | Alternating polynomial,Discrete mathematics,Graph,Indifference graph,Combinatorics,Square-free polynomial,Chordal graph,Matching polynomial,Matrix polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
105 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hailiang Zhang | 1 | 8 | 3.73 |
| Jinlong Shu | 2 | 99 | 24.28 |