Name
Abstract | ||
|---|---|---|
j=0 (−1) j p(G, j)xn −2 j, called the matching polynomial of G, is closely related to the Hosoya index introduced in applications in physics and chemistry. In this work we generalize this polynomial by introducing the number of disjoint paths of length t, denoted by pt(G, j). We compare this higher-order matching polynomial with the usual one, establishing similarities and differences. Some interesting examples are given. Finally, connections between our gen- eralized matching polynomial and hypergeometric functions are found. 1. Introduction Let G be a graph with n vertices and let p(G, j) be equal to the number of ways in which j mutually nonincident edges can be selected in G.B y def inition,p(G,0) = 1 and clearly p(G,1) is equal to the number of edges. The Hosoya topological index Z(G )i s def ined as follows (13): |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1155/IJMMS.2005.1565 | Int. J. Math. Mathematical Sciences |
Keywords | Field | DocType |
topological index,hypergeometric function,indexation,higher order | Alternating polynomial,Mathematical analysis,Bracket polynomial,Monic polynomial,Reciprocal polynomial,Matrix polynomial,Topology,Discrete mathematics,Combinatorics,Square-free polynomial,Matching polynomial,Hosoya index,Mathematics | Journal |
Volume | Issue | Citations |
2005 | 10 | 1 |
PageRank | References | Authors |
0.37 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oswaldo Araujo | 1 | 13 | 3.11 |
| Mario Estrada | 2 | 1 | 0.37 |
| Daniel A. Morales | 3 | 6 | 2.00 |
| Juan Rada | 4 | 36 | 10.02 |