Results 51 to 60 of about 114 (91)
O espectro da matriz distância de uma família de grafos distância-birregulares
, 2023 É sabido que para um grafo conexo qualquer, a quantidade de autovalores distintos da sua matriz de adjacência é pelo menos o valor do diâmetro do grafo mais um, valendo o mesmo para as matrizes Laplaciana e Laplaciana sem sinal.
Silva, Tayná Lobo da
core
Developments on Spectral Characterizations of Graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core +2 more sources
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Int J Quantum Chem, 2023 Rauf A, Naeem M, Hanif A.
europepmc +1 more source
Eigenvalue-based entropy in directed complex networks. [PDF]
PLoS One, 2021 Sun Y, Zhao H, Liang J, Ma X.
europepmc +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Front Chem, 2023 Munir MM, Wusqa UT.
europepmc +1 more source
Деякі оцінки для лапласіанового енергоподібного інваріанта із беззнаковою відстанню у мережах
For a graph or network $G$, denote by $D(G)$ the distance matrix and $Tr(G)$ the diagonal matrix of vertex transmissions. The distance signless Laplacian matrix of $G$ is $D^{Q}(G)=Tr(G)+D(G)$.
Pirzada, S. +3 more
core +1 more source
Some properties of generalized distance eigenvalues of graphs
summary:Let $G$ be a simple connected graph with vertex set $V(G)=\{v_1,v_2,\dots ,v_n \}$ and edge set $E(G)$, and let $d_{v_{i}}$ be the degree of the vertex $v_i$. Let $D(G)$ be the distance matrix and let $T_r(G)$ be the diagonal matrix of the vertex
Ma, Yuzheng, Shao, Yanling
core +1 more source
Spectral recognition of graphs and networks
, 2014 Spektralna teorija grafova je matematiˇcka teorija koja grafove prouˇcava pomo´cu sopstvenih vrednosti i sopstvenih vektora matrica koje su im pridruˇzene.
Jovanović, Irena M.
core +1 more source
3-partite Turán graphs due to edge deletion the change of distance signless Laplacian energy
Euler tarafından yapılan çalışmayla veya en yaygın bilinen haliyle Könisberg Köprü Problemi ile başlayan graf teorinin oldukça yaygın kullanım alanları vardır.
Öznalcılar, Betül Sena
core
Q-espectro e D-espectro dos grafos aranha
, 2017 Os grafos do tipo aranha tem características interessantes, pois são todos conexos com complementar conexo (mais ainda, o complementar de qualquer grafo aranha também é um grafo aranha). Além disso, são os únicos grafos na classe dos P4-esparsos que são
Portugal, Lucas Lima Silva
core