Results 91 to 100 of about 6,799 (133)

The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition

open access: yesFilomat, 2020
We consider two classes of the graphs with a given bipartition. One is trees and the other is unicyclic graphs. The signless Laplacian coefficients and the incidence energy are investigated for the sets of trees/unicyclic graphs with n vertices in which each tree/unicyclic graph has an (n1,n2)-bipartition, where n1 and n2 are positive integers
Zhong, Lei, Wang, Wen-Huan
openaire   +3 more sources

Exploring spectrum-based descriptors in pharmacological traits through quantitative structure property (QSPR) analysis

open access: yesFrontiers in Physics
The study centered on Quantitative Structure Property Relationship (QSPR) analysis with a focus on various graph energies, investigating drugs like Mefloquinone, Sertraline, Niclosamide, Tizoxanide, PHA-690509, Ribavirin, Emricasan, and Sofosbuvir ...
Ali Raza, Muhammad Mobeen Munir
doaj   +1 more source

Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs

open access: yesLe Matematiche, 2019
Summary: In this paper, we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and obtain some bounds for the maximum eigenvalue of this matrix. We also focus on bipartite graphs and find some bounds for the spectral radius of the reciprocal distance signless Laplacian matrix of this class of graphs. Moreover,
A. Alhevaz, M. Baghipur, H.S. Ramane
openaire   +1 more source

Some new bounds for the signless Laplacian energy of a graph

open access: yes, 2020
For a simple graph $G$ with $n$ vertices, $m$ edges and signless Laplacian eigenvalues $q_{1} \geq q_{2} \geq \cdots \geq q_{n} \geq 0$, its the signless Laplacian energy $QE(G)$ is defined as $QE(G) = \sum_{i=1}^{n}|q_{i} - \bar{d} |$, where $\bar{d} = \frac{2m}{n}$ is the average vertex degree of $G$.
Wang, Peng, Huang, Qiongxiang
openaire   +2 more sources

Similarity Measures and Energy-Based Decision-Making in Intuitionistic Fuzzy Rough Graphs

open access: yesInternational Journal of Computational Intelligence Systems
A novel intuitionistic fuzzy rough similarity measure for classifying intuitionistic fuzzy rough graphs (IFRG) is presented in this study. Using both objective and subjective, it presents intuitionistic fuzzy rough preference relationships (IFRPRs) to ...
Noorjahan Shaik, Sharief Basha Shaik
doaj   +1 more source

Equivalence between spectral properties of graphs with and without loops

open access: yes, 2018
In this paper we introduce a spectra preserving relation between graphs with loops and graphs without loops. This relation is achieved in two steps.
Andreotti, Eleonora   +2 more
core  

Home - About - Disclaimer - Privacy