𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of Nodal Domains on Quantum Graphs as a Stability Index of Graph Partitions

✍ Scribed by Ram Band; Gregory Berkolaiko; Hillel Raz; Uzy Smilansky

Book ID
113022938
Publisher
Springer
Year
2011
Tongue
English
Weight
475 KB
Volume
311
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of distinct minimal clique
On the number of distinct minimal clique partitions and clique covers of a line graph
✍ Sean McGuinness; Rolf Rees πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

On the Hosoya index and the Merrifield–S
On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number
✍ Kexiang Xu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 377 KB

The Hosoya index and the Merrifield-Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let W n,k be the set of connected graphs with