On distance two graphs of upper bound graphs |
| |
Authors: | Kenjiro Ogawa |
| |
Institution: | Department of Mathematical Sciences, Tokai University, Hiratsuka 259-1292, Japan |
| |
Abstract: | For a poset P=(X,≤), the upper bound graph (UB-graph) of P is the graph U=(X,EU), where uv∈EU if and only if u≠v and there exists m∈X such that u,v≤m. For a graph G, the distance two graph DS2(G) is the graph with vertex set V(DS2(G))=V(G) and u,v∈V(DS2(G)) are adjacent if and only if dG(u,v)=2. In this paper, we deal with distance two graphs of upper bound graphs. We obtain a characterization of distance two graphs of split upper bound graphs. |
| |
Keywords: | Upper bound graphs Distance two graphs Split graphs |
本文献已被 ScienceDirect 等数据库收录! |
|