首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Structural Properties and Hamiltonicity of Neighborhood Graphs
Authors:Ingo Schiermeyer  Martin Sonntag  Hanns-Martin Teichert
Institution:1. Faculty of Mathematics and Computer Science, Freiberg University of Mining and Technology, Prüferstr. 1, 09596, Freiberg, Germany
2. Institute of Mathematics, University of Lübeck, Wallstr. 40, 23560, Lübeck, Germany
Abstract:Let G = (V, E) be a simple undirected graph. N(G) =  (V, E N ) is the neighborhood graph of the graph G, if and only if $$E_N = \{\{a,b\}\,|\, a \neq b\,\wedge\,\exists\, x \, \in V: \{x,a\} \in E \, \wedge \, \{x,b\} \in E \}.$$ We present several structural properties of N(G) and characterize the hamiltonicity of N(G) by means of chords of a hamiltonian cycle in G.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号