Results 81 to 90 of about 6,799 (133)
Laplacian coefficients of unicyclic graphs with the number of leaves and girth
Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda)=\sum_{k=0}^n (-1)^{k}c_{k}(G)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c}, M.
Zhang, Jie, Zhang, Xiao-Dong
core +1 more source
Abstract Landscape functions are a popular tool used to provide upper bounds for eigenvectors of Schrödinger operators on domains. We review some known results obtained in the last 10 years, unify several approaches used to achieve such bounds, and extend their scope to a large class of linear and nonlinear operators. We also use landscape functions to
Delio Mugnolo
wiley +1 more source
Bounds for Incidence Energy of Some Graphs
Let G be a simple graph. The incidence energy (IE for short) of G is defined as the sum of the singular values of the incidence matrix. In this paper, a new upper bound for IE of graphs in terms of the maximum degree is given. Meanwhile, bounds for IE of the line graph of a semiregular graph and the paraline graph of a regular graph are obtained.
Weizhong Wang, Dong Yang, Magdy A. Ezzat
wiley +1 more source
Distance Spectra of Some Double Join Operations of Graphs
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha +4 more
wiley +1 more source
On the diameter and incidence energy of iterated total graphs
The total graph of $G$, $\mathcal T(G)$ is the graph whose set of vertices is the union of the sets of vertices and edges of $G$, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in $G$.
Lenes, Eber +3 more
core +1 more source
The signless Laplacian coefficients and incidence energy of bicyclic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Zhang, Xiao-Dong Zhang
openaire +1 more source
On spectrum and energies of enhanced power graphs
The enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj +1 more source
On a new conformal functional for simplicial surfaces
We introduce a smooth quadratic conformal functional and its weighted version $$W_2=\sum_e \beta^2(e)\quad W_{2,w}=\sum_e (n_i+n_j)\beta^2(e),$$ where $\beta(e)$ is the extrinsic intersection angle of the circumcircles of the triangles of the mesh ...
A Ben-Israel +12 more
core +1 more source
ENERGY OF NON-COPRIME GRAPH ON MODULO GROUP
A graph is a mathematical structure consisting of a non-empty set of vertices and a set of edges connecting these vertices. In recent years, extensive research on graphs has been conducted, with one of the intriguing topics being the representation of ...
Gusti Yogananda Karang +2 more
doaj +1 more source
Asymptotic Laplacian-Energy-Like Invariant of Lattices [PDF]
Let $\mu_1\ge \mu_2\ge\cdots\ge\mu_n$ denote the Laplacian eigenvalues of $G$ with $n$ vertices. The Laplacian-energy-like invariant, denoted by $LEL(G)= \sum_{i=1}^{n-1}\sqrt{\mu_i}$, is a novel topological index.
Hu, Feng-Feng +3 more
core

