Results 31 to 40 of about 5,566,785 (118)
On maximum degree (signless) Laplacian matrix of a graph
, 2022 Let G be a simple graph on n vertices and v1, v2, . . . , vn be the vertices ofG. We denote the degree of a vertex vi in G by dG(vi) = di. The maximumdegree matrix of G, denoted by M(G), is the real symmetric matrix withits ijth entry equal to max{di, dj}
Raghu, V. D. +2 more
core +1 more source
Note on the Sum of Powers of Normalized Signless Laplacian Eigenvalues of Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In this paper, for a connected graph G and a real α≠0, we define a new graph invariant σα(G)-as the sum of the alphath powers of the normalized signless Laplacian eigenvalues of G.
Ş. Burcu Bozkurt Altındağ
doaj +1 more source
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Mathematics, 2023 Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix,
Shaun Fallat, Seyed Ahmad Mojallal
doaj +1 more source
On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
, 2022 Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$.
Pirzada, S., Khan, Saleem
core +1 more source
The signless Laplacian spread [PDF]
, 2010 The signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) are the maximum and minimum eigenvalues of the signless Laplacian matrix of G, respectively. This paper presents some upper and lower bounds for SQ(G).
Liu, Bolian, Liu, Muhuo
core +1 more source
On the signless Laplacian and normalized signless Laplacian spreads of graphs
, 2022 Let G = (V, E), V = {v1, v2, …, vn}, be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≽ d2 ≽ … ≽ dn. Denote by A and D the adjacency matrix and diagonal vertex degree matrix of G, respectively.
Igor Milovanović +8 more
core +1 more source
Certain Notions of Energy in Single-Valued Neutrosophic Graphs
Axioms, 2018 A single-valued neutrosophic set is an instance of a neutrosophic set, which provides us an additional possibility to represent uncertainty, imprecise, incomplete and inconsistent information existing in real situations.
Sumera Naz +2 more
doaj +1 more source
Signless Normalized Laplacian for Hypergraphs [PDF]
, 2021 The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Mulas, Raffaella +5 more
core +1 more source
The smallest eigenvalue of the signless Laplacian [PDF]
, 2011 Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied.
Nikiforov, Vladimir +7 more
core +1 more source
On the Boundary of Incidence Energy and Its Extremum Structure of Tricycle Graphs
Frontiers in Physics, 2020 With the wide application of graph theory in circuit layout, signal flow chart and power system, more and more attention has been paid to the network topology analysis method of graph theory.
Hongyan Lu, Zhongxun Zhu
doaj +1 more source