Results 51 to 60 of about 3,180,841 (100)
On the eigenvalues of the distance signless Laplacian matrix of graphs
Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn.
Shooshtari, Hajar +3 more
core +1 more source
Novel descriptors for the prediction of molecular properties
Open ChemistryMolecular descriptors are fundamental to the fields of cheminformatics, drug discovery, and materials science, serving as quantitative representations of molecular structures that facilitate the prediction of various properties and activities.
Nizami Abdul Rauf +3 more
doaj +1 more source
Signless Laplacian determinations of some graphs with independent edges [PDF]
, 2018 Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
Abdian, A.Z. +3 more
core +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
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
, 2021 Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
core +1 more source
On the distance signless Laplacian spectral radius of graphs and digraphs
, 2017 Let \eta(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper,bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless ...
Li, Dan +5 more
core +1 more source
Spektrum Distance Laplacian dan Distance Signless Laplacian pada Graf Bipartit Lengkap (K_(n,n) ) dan Graf Tripartit Lengkap (K_(n,n,n) ) [PDF]
, 2023 Susunan nilai eigen dari matriks ketetanggaan beserta multiplisitasnya disebut spektrum graf. Spektrum graf yang dihasilkan dari matriks distance Laplacian disebut sebagai spektrum distance Laplacian, sedangkan spektrum yang dihasilkan dari matriks ...
RAMADANI, Dian
core
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Pratima Panigrahi +2 more
core +1 more source
On the Laplacian and signless Laplacian spectra of complete multipartite graphs [PDF]
, 2017 Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adjacency matrix of G is an (nn)-matrix A(G) = [aij] where aij = 1 if vivj E(G) and aij = 0 elsewhere, and the degree matrix of G is a diagonal (nn)-matrix ...
Ikawati, Deasy Sandhya Elya +2 more
core +4 more sources
This research investigates the relationship between algebra and graph theory, specifically how algebra facilitates graph theory. Associating matrices with graphs introduces the concept of graph energies.
Abdurahim, Abdurahim +5 more
core +1 more source