Nested (2,r)-regular graphs and their network properties.
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph G is (2, r)-regular where p, s, and m are positive integers, and m ≥ 2, then when n is sufficiently large, then G is isomorphic to G = Ks+mKp, where 2(p-1)+s =...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2012
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/1471 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2664&context=etd |