Results 61 to 70 of about 121 (97)

Spectral properties of some special matrices of 〖Kite〗_(p,q)

, 2021
p noktalı bir tam grafın (K_p) keyfi bir noktasına, q noktalı bir yol grafın 〖(P〗_q) keyfi bir sarkıt noktasının bağlanmasıyla elde edilen özel grafa p+q noktalı uçurtma graf denir ve 〖Kite〗_p^q ile gösterilir [16].
Üngür, Yusuf, Topcu, Hatice
core  

A characterization of extremal non-transmission-regular graphs by the distance (signless Laplacian) spectral radius

Let $G$ be a simple connected graph of order $n$ and $\partial(G)$ is the spectral radius of the distance matrix $D(G)$ of $G$. The transmission $D_i$ of vertex $i$ is the $i$-th row sum of $D(G)$. Denote by $D_{\max}(G)$ the maximum of transmissions over all vertices of $G$, and $\partial^Q(G)$ is the spectral radius of the distance signless Laplacian
Lan, Jingfen, Liu, Lele
openaire   +2 more sources

Sufficient conditions for spanning trees with constrained leaf distance in a graph

The leaf distance of a tree is the minimum of distances between any two leaves of a tree. It is well known that seeking sufficient conditions for a graph to have some special kinds of spanning trees is an interesting and popular problem.
Jianxi Li, Lv, Xiaoyun, Xiaoyun Lv, Li, Jianxi, Hongzhang Chen, Chen, Hongzhang, Shou-Jun Xu, Xu, Shou-Jun   +7 more
core   +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., Shang, Y., Alhevaz, A., Baghipur, M.   +3 more
core   +1 more source

Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph. [PDF]

J Inequal Appl, 2018
Jia H, Song H.
europepmc   +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

Predictive modeling for physicochemical properties of β-lactam antibiotics through eigenvalue based topological indices and non linear regression techniques. [PDF]

Sci Rep
Yuvaraj A, Kalaimurugan G, Thamizhmaran R, Tajudeen MM, Contreras RC.   +4 more
europepmc   +1 more source

On comparison between the distance energies of a connected graph. [PDF]

Heliyon
Ganie HA, Rather BA, Shang Y.
europepmc   +1 more source

Predictive potential of distance-related spectral graphical descriptors for structure-property modeling of thermodynamic properties of polycyclic hydrocarbons with applications. [PDF]

Sci Rep
Hayat S, Alanazi SJF, Imran M, Azeem M.
europepmc   +1 more source

Persistent Mayer Dirac. [PDF]

J Phys Complex
Suwayyid F, Wei GW.
europepmc   +1 more source