The distance spectrum of two new operations of graphs

Let $G$ be a connected graph with vertex set $V(G)=\{v_1, v_2,\ldots,v_n\}$‎. ‎The distance matrix $D=D(G)$ of $G$ is defined so that its $(i,j)$-entry is equal to the distance $d_G(v_i,v_j)$ between the vertices $v_i$ and $v_j$ of $G$‎. ‎The eigenvalues ${\mu_1, \mu_2,\ldots,\mu_n}$ of $D(G)$ are t...

Cijeli opis

Bibliografski detalji

Glavni autori:	Zikai Tang, Renfang Wu, Hanlin Chen, Hanyuan Deng
Format:	Artigo
Jezik:	Inglês
Izdano:	University of Isfahan 2020-09-01
Serija:	Transactions on Combinatorics
Teme:	‎adjacency spectrum‎ ‎distance spectrum‎ ‎distance energy
Online pristup:	https://toc.ui.ac.ir/article_24467_d2bacaa1da976e615698f1efa93b6605.pdf
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!