Name
Abstract | ||
|---|---|---|
An (f, 2)-graph is a multigraph C such that each vertex of C has degree either f or 2. Let S(n, f) denote the simple graph whose vertex set is the set of unlabeled (f, 2)-graphs of order no greater than n and such that {G, H} is an edge in S(n, f) if and only if H can be obtained from G by either an insertion or a suppression of a vertex of degree 2. We also consider digraphs whose nodes are labeled or unlabeled (f, 2)-multigraphs and with arcs (G, H) defined as for {G, H}.We study the structure of these graphs and digraphs. In particular, the diameter of a given component is determined. We conclude by defining a random proccess on these digraphs and derive some properties. Chemistry applications are suggested. |
Year | Venue | Keywords |
|---|---|---|
2002 | ARS COMBINATORIA | random graph, bounded degree graph, graph process |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics | Journal | 64 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Louis V. Quintas | 1 | 22 | 11.30 |
| Jerzy Szymanski | 2 | 36 | 34.38 |