Abstract
Given a graph , the adjacency matrix and degree diagonal matrix of are denoted by and , respectively. In 2017, Nikiforov \cite{0007} proposed the -matrix: where . The largest eigenvalue of this novel matrix is called the -index of . In this paper, we characterize the graphs with minimum -index among -vertex graphs with independence number for , where whereas for we consider the same problem for Furthermore, we determine the unique graph (resp. tree) on vertices with given independence number having the maximum -index with , whereas for the -vertex bipartite graphs with given independence number, we characterize the unique graph having the maximum -index with
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.