Name
Abstract | ||
|---|---|---|
Let G be a graph with n vertices and R-1, R-2, ... , distinct rooted graphs. The compound graph G[R-1, R-2, ... , R,] is obtained by identifying the root of Ri with the i-th vertex of G, i = 1, 2, ... , n. Inspired by the study of community structure in connection networks, Tittmann, Averbouch and Makowsky introduce the subgraph component polynomial Q(G; x, y), which counts the number of connected components in vertex induced subgraphs. The sub graph component polynomial contains several other polynomial invariants, such as the independence polynomial. Motivated by a result of Gutman on the independence polynomial of G[R-1, R-2, ... , R-n], we extend the result for the subgraph component polynomial. |
Year | Venue | Field |
|---|---|---|
2018 | ARS COMBINATORIA | Discrete mathematics,Graph,Combinatorics,Polynomial,Mathematics |
DocType | Volume | ISSN |
Journal | 136 | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| xiaoliang xie | 1 | 10 | 9.03 |
| Yunhua Liao | 2 | 0 | 0.34 |