LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Bounds for peripheral distance signless Laplacian eigenvalues of graphs

Photo by maxchen2k from unsplash

The eccentricity of a vertex [Formula: see text] in a graph [Formula: see text] is the maximum distance between [Formula: see text] and any other vertex of [Formula: see text]… Click to show full abstract

The eccentricity of a vertex [Formula: see text] in a graph [Formula: see text] is the maximum distance between [Formula: see text] and any other vertex of [Formula: see text] A vertex with maximum eccentricity is called a peripheral vertex. In this paper, we study the distance signless Laplacian matrix of a connected graph [Formula: see text] with respect to peripheral vertices and define the peripheral distance signless Laplacian matrix of a graph [Formula: see text], denoted by [Formula: see text]. We then give some bounds on various eigenvalues of [Formula: see text] Moreover, we define energy in terms of [Formula: see text] and give some bounds on the energy.

Keywords: distance signless; see text; signless laplacian; formula see

Journal Title: Asian-European Journal of Mathematics
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.