Name
Abstract | ||
|---|---|---|
In 2000 Cho, Kim and Nam proved that P\"n, the path on n vertices, is a 2-step competition graph for all n. In 2005, Helleloid proved that P\"n is an (n-1)- and (n-2)-step competition graph for all n and proved further that of all connected triangle-free graphs on n vertices, only the star is an m-step competition graph for m=n. In this paper we show that if m divides n-1 or n-2, then P\"n is an m-step competition graph and that if n=6 and n2@?m@?n-3, then P\"n is not an m-step competition graph. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.06.009 | Discrete Mathematics |
Keywords | Field | DocType |
m -step competition path walk digraph,m-step competition path walk digraph,m | Wheel graph,Discrete mathematics,Random regular graph,Combinatorics,Graph power,Cycle graph,Factor-critical graph,Pancyclic graph,Mathematics,Complement graph,Path graph | Journal |
Volume | Issue | ISSN |
310 | 19 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.44 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaromy Kuhl | 1 | 10 | 4.72 |
| Brandon Christopher Swan | 2 | 2 | 0.44 |
| SwanBrandon Christopher | 3 | 2 | 0.44 |