Name
Abstract | ||
|---|---|---|
The maximum number of non-isomorphic one-edge extensions M(t, n,f) of a graph of size t, order n, and vertex degree bounded by f for 3 <= f <= n - 2 is considered. An upper bound for M(t, n,f) is obtained and for the case f = n - 2 the exact value is given. Tables for all values of M(t, n, f) are provided for up to n = 12, left perpendicular n(f - 1) /2 right perpendicular <t <= left perpendicular nf /2 right perpendicular, and 3 <= f <= n- 2. It is also noted how the general results are related to the transition digraph for the Random f-Graph Process, a Markov process pertaining to graphs with vertex degree bounded by f. |
Year | Venue | Keywords |
|---|---|---|
2014 | ARS COMBINATORIA | graphs with bounded degree,one-edge extensions,Random f-Graph Process |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Mathematics,Bounded function | Journal | 115 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krystyna T. Balinska | 1 | 8 | 5.35 |
| Louis V. Quintas | 2 | 22 | 11.30 |
| Krzysztof Zwierzyński | 3 | 4 | 2.08 |