| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602283 | Linear Algebra and its Applications | 2009 | 13 Pages |
Abstract
Let T(2k) be the set of all tricyclic graphs on 2k(kā©¾2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with the largest index in T(2k).
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
