On the spectral radius of VDB graph matrices

О спектральном радиусе матриц графов ВДБ

Спектрални радијус ВДБ графовских матрица

Ivan Gutmana gutman@kg.ac.rs

University of Kragujevac, Serbia

This work is licensed under Creative Commons Attribution 4.0 International.

This paper concerns simple connected graphs. Let G be such a graph. Its vertex and edges sets are V(G) and E(G), respectively, whereas its order (number of vertices) and size (number of edges) are |V(G)|=n and |E(G)|=m, respectively. By uv $\text{∊}$ (G), we denote the edge of G connecting the vertices u and v.

The degree (= number of first neighbors) of a vertex u $\text{∊}$ V(G) is denoted by d_u. If d_u = r for all u $\text{∊}$ V(G) , then G is said to be a regular graph of the degree r. If d_u=n-1 for all u $\text{∊}$ V(G), then G is the complete graph (of the order n), denoted by K_n.

For other graph-theoretical notions, the readers are referred to standard textbooks (Harary, 1969; Bondy & Murthi, 1976).

In the present-day mathematical and chemical literature, a large number, well over hundred, of degree-based graph invariants of the form

(1)

are being studied, where f(x,y) is an appropriately chosen function with the property f(x,y) = f(y,x) and f(x,y) $\ge$ 0 for all x,y = d_u,d_v.

In chemistry, molecular physics, pharmacology, and elsewhere, these graph invariants found a great variety of applications, and are usually referred to as „topological indices“ or „molecular structure-descriptors“ (Gutman, 2013; Todeschini & Consonni, 2009; Kulli, 2020). Instead of „vertex-degree-based“ the abbreviation VDB is often used (Rada, 2014; Li et al, 2021; Monsalve & Rada, 2022).

Let the vertices of the graph G be labelled as v₁,v₂,...,v_n. Then, to each VDB graph invariant TI(f;G), a symmetric square matrix M(f;G) of the order n can be associated, whose (i,j)-element is equal to f(d_vi,d_vj) if the vertices v_i and v_j are adjacent, i.e. if v_i,v_j $\text{∊}$ E(G), and is equal to zero otherwise. In particular, TI(f;G)_ii = 0 for all i =1,2,...,n.

As it is well known in linear algebra (Brualdi & Cvetković, 2008), the eigenvalues of M(f;G) are real-valued numbers, forming the spectrum of the matrix M(f;G). Further on, they will be denoted by so that . Then and therefore is called the spectral radius of the corresponding VDB graph matrix (Stevanović, 2015).

In order to prove our main result, Theorem 1, we need an auxiliary lemma.

Lemma 1. Let be the eigenvalues of the VDB matrix M(f;G). Then

(2)

and

(3)

Proof. By definition of the matrix M(f;G), its diagonal elements are always equal to zero. From this, Eq. (2) follows straightforwardly.

In order to arrive at Eq. (3), note that the sum of k-th powers of the eigenvalues is equal to the trace (sum of diagonal elements) of the k-th power of the respective matrix. Thus,

where we used the above specified definition of the elements of the VDB matrix M(f;G).

Note that the above lemma is a direct generalization of Lemma 1 in (Gutman, 2021), stated for a special case of the function f in Eq. (1), namely for

We are now prepared to state our main result

Theorem 1. Let G be a connected graph of the order n, and let be the spectral radius of its VDB matrix M(f;G) . Then is bounded as:

(4)

The equality on the left-hand side holds if and only if G is regular. The equality on the right-hand side holds if

Lower bound. We proceed in an analogous manner as in the proof of Lemma 2 in (Gutman, 2021). Thus, in view of the Rayleigh-Ritz variational principle, for an n-dimensional column-vector ,

(5)

with equality if and only if is an eigenvector of M(f;G), corresponding to the eiigenvalue . As it is well known (Brualdi & Cvetković, 2008; Cvetković et al, 2010), this happens if and only if the graph G is regular.

The lower bound for the spectral radius follows directly from Eq. (5).

Upper bound. Eq. (2) can be rewritten as

Using the Cauchy-Schwarz inequality, we get

(6)

implying

i.e.,

The upper bound for the spectral radius is followed by Eq. (3).

The equality in (6) happens if and only if which is the case only for the complete graph K_n. Recall that the complete graph is an (n-1)-regular graph, and therefore its VDB matrix is equal to where A(G) stands for the ordinary adjacency matrix of the graph G. Since the ordinary eigenvalues of K_n are (Cvetković et al, 2010), the VDB-eigenvalues of the complete graph satisfy The complete graph is the only connected graph whose all eigenvalues, except the spectral radius, are mutually equal.

As already mentioned, the special case of the lower bound in Theorem 1 for was reported in (Gutman, 2021). The same special case for the upper bound was recently communicated in (Lin et al, 2023).

FIELD: mathematics (mathematics subject classification: primary 05C50, secondary 05C07, 05C09)

ARTICLE TYPE: original scientific paper

EDITORIAL NOTE: The author of this article, Ivan Gutman, is a current member of the Editorial Board of the Military Technical Courier. Therefore, the Editorial Team has ensured that the double blind reviewing process was even more transparent and more rigorous. The Team made additional effort to maintain the integrity of the review and to minimize any bias by having another associate editor handle the review procedure independently of the editor – author in a completely transparent process. The Editorial Team has taken special care that the referee did not recognize the author’s identity, thus avoiding the conflict of interest.

КОММЕНТАРИЙ РЕДКОЛЛЕГИИ: Автор данной статьи Иван Гутман является действующим членом редколлегии журнала «Военно-технический вестник». Поэтому редколлегия провела более открытое и более строгое двойное слепое рецензирование. Редколлегия приложила дополнительные усилия для того чтобы сохранить целостность рецензирования и свести к минимуму предвзятость, вследствие чего второй редактор-сотрудник управлял процессом рецензирования независимо от редактора-автора, таким образом процесс рецензирования был абсолютно прозрачным. Редколлегия во избежание конфликта интересов позаботилась о том, чтобы рецензент не узнал кто является автором статьи.

РЕДАКЦИЈСКИ КОМЕНТАР: Аутор овог чланка Иван Гутман је актуелни члан Уређивачког одбора Војнотехничког гласника. Због тога је уредништво спровело транспарентнији и ригорознији двоструко слепи процес рецензије. Уложило је додатни напор да одржи интегритет рецензије и необјективност сведе на најмању могућу меру тако што је други уредник сарадник водио процедуру рецензије независно од уредника аутора, при чему је тај процес био апсолутно транспарентан. Уредништво је посебно водило рачуна да рецензент не препозна ко је написао рад и да не дође до конфликта интереса.

https://scindeks.ceon.rs/article.aspx?artid=0042-84692301001G (html)

https://aseestant.ceon.rs/index.php/vtg/article/view/41411 (pdf)

https://doaj.org/article/0901fc0abb014e2d916717af3604c9fe (pdf)

https://elibrary.ru/item.asp?id=50193868 (pdf)

http://www.vtg.mod.gov.rs/archive/2023/military-technical-courier-1-2023.pdf (pdf)