Name
Abstract | ||
|---|---|---|
For a graph G, the middle graph M(G) of G is the graph with vertex set V(G)∪E(G) in which the vertices x and y are joined by an edge if {x,y}∩E(G)≠∅, and x and y are adjacent or incident in G. In this note, we show that the complement of middle graph M(G) of a graph G is hamiltonian if and only if G is not a star and is not isomorphic to any graph in {K1,2K1,K2,K2∪K1,K3,K3∪K1}. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2006.07.028 | Discrete Mathematics |
Keywords | Field | DocType |
Middle graph,Complement,Hamilton cycle | Discrete mathematics,Combinatorics,Vertex-transitive graph,Edge-transitive graph,Bound graph,Graph power,Cubic graph,Regular graph,Distance-regular graph,Symmetric graph,Mathematics | Journal |
Volume | Issue | ISSN |
307 | 9 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinhui An | 1 | 18 | 5.55 |
| Baoyindureng Wu | 2 | 99 | 24.68 |