Name
Abstract | ||
|---|---|---|
The matching energy of a graph is defined as the sum of the absolute values of the zeros of itsmatching polynomial. For any integer t >= 1, a graph G is called t-apex tree if there exists a t-set X subset of V(G) such that G - X is a tree, while for any Y subset of V(G) with vertical bar Y vertical bar < t, G - Y is not a tree. Let T-t(n) be the set of t-apex trees of order n. In this article, we determine the extremal graphs from T-t(n) with minimal and maximal matching energies, respectively. Moreover, as an application, the extremal cacti of order n and with s cycles have been completely characterized at which the minimal matching energy are attained. (C) 2015Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/cplx.21651 | COMPLEXITY |
Keywords | Field | DocType |
t-apex tree,matching energy,quasi-order,cactus | Integer,Discrete mathematics,Graph,Combinatorics,Apex (geometry),Absolute value,Matching polynomial,Matching (graph theory),Factor-critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
21.0 | 5 | 1076-2787 |
Citations | PageRank | References |
2 | 0.40 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kexiang Xu | 1 | 72 | 11.43 |
| zhiqing zheng | 2 | 2 | 0.40 |
| Kinkar Ch. Das | 3 | 208 | 30.32 |