Name
Abstract | ||
|---|---|---|
In this paper we present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. We show that the graphs in all such families possess some general properties including regularity and bi-regularity, existence of special vertex colorings, and existence of covering maps — hence, embedded spectra — between every two members of the same family. Another general property, recently discovered, is that nearly every graph constructed in this manner edge-decomposes either the complete, or complete bipartite, graph which it spans. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S1571-0653(05)80165-9 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Girth,embedded spectra,cover of a graph,edge-decomposition,polarity graph,bipartite double,neighborhood-complete coloring,star-complete coloring | Complete bipartite graph,Discrete mathematics,Circulant graph,Combinatorics,Lévy family of graphs,Line graph,Forbidden graph characterization,Cograph,Extremal graph theory,Universal graph,Mathematics | Journal |
Volume | ISSN | Citations |
5 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Felix Lazebnik | 1 | 353 | 49.26 |
| Andrew Woldar | 2 | 1 | 1.39 |