A Relationship between the Walks and the Semi-Edge Walks of Graphs
Received:November 04, 2016  Revised:January 05, 2017
Key Word: walks   semi-edge walks   signless Laplacian spectral radius   planar graphs  
Fund ProjectL:Supported by GRF of Hong Kong (Grant No.HKBU202413), FRG of Hong Kong Baptist University (Grant No.FRG2/14-15/012).
Author NameAffiliation
Peng HUANG Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, P. R. China 
Wai Chee SHIU Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, P. R. China 
Pak Kiu SUN Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, P. R. China 
Hits: 242
Download times: 281
Abstract:
      We establish a relation between the number of semi-edge walks of a connected graph and the number of walks of two auxiliary graphs. In addition, this relation gives upper bounds on the signless Laplacian spectral radius of connected graphs and planar graphs.
Citation:
DOI:10.3770/j.issn:2095-2651.2017.05.002
View Full Text  View/Add Comment  Download reader