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


Distance-Balanced Graphs
Authors:Janja Jerebic  Sandi Klav?ar  Douglas F Rall
Institution:(1) Department of Mathematics and Computer Science FNM, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia;(2) Department of Mathematics, Furman University, Greenville, SC 29613, USA
Abstract:Distance-balanced graphs are introduced as graphs in which every edge uv has the following property The number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced Cartesian and lexicographic products of graphs are also characterized. Several open problems are posed along the way. Received August 31, 2005
Keywords::" target="_blank">:  graph distance  distance-balanced graphs  graph products  connectivity
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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