Name
Abstract | ||
|---|---|---|
Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. Tis a dominating trail (D-trail) if every edge of G is incident with at least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of ver- tices or edges are derived for graphs to have an S-trail, S-circuit, D-trail, or D-circuit. Thereby a result of Brualdi and Shanny and one mentioned by Lesniak-Foster and Williamson are improved. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1002/jgt.3190100105 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
lower bound | Graph theory,Topology,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Electronic circuit,Mathematics | Journal |
Volume | Issue | ISSN |
10.0 | 1.0 | 0364-9024 |
Citations | PageRank | References |
7 | 3.49 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. J. Veldman | 1 | 262 | 44.44 |
| TW € N TE | 2 | 7 | 3.49 |