Name
Abstract | ||
|---|---|---|
We discuss a conjecture of J. R. Griggs relating the maximum number of leaves in a spanning tree of a simple, connected graph to the order and independence number of the graph. We prove a generalization of this conjecture made by the computer program Graffiti, and discuss other similar Conjectures, including several generalizations of the theorem that the independence number of a simple, connected graph is not less than its radius. |
Year | Venue | Keywords |
|---|---|---|
2001 | DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCES | independence number,connected dominating set,radius,path covering number,Graffiti |
Field | DocType | Volume |
Graffiti,Discrete mathematics,Mathematics | Conference | 69 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ermelinda Delavina | 1 | 23 | 4.51 |
| Siemion Fajtlowicz | 2 | 93 | 26.12 |
| William Waller | 3 | 3 | 0.86 |