Name
Abstract | ||
|---|---|---|
A nonempty vertex set X subset of V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.7151/dmgt.1653 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
cycle,hamiltonian,1-hamiltonian | Discrete mathematics,Trémaux tree,Indifference graph,Combinatorics,Bound graph,Graph power,Chordal graph,Cycle graph,Metric dimension,Pancyclic graph,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 1 | 1234-3099 |
Citations | PageRank | References |
2 | 0.51 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |
| Erhard Hexel | 2 | 24 | 4.54 |
| Stanislav Jendrol' | 3 | 283 | 38.72 |