Distinctive power of the alliance polynomial for regular graphs
✍ Scribed by Carballosa, Walter; Rodríguez, José M.; Sigarreta, José M.; Torres-Nuñez, Yadira
- Book ID
- 127060493
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 198 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cas