Results 31 to 40 of about 67,630 (266)
Indefinite Eigenvalue Problems for p-Laplacian Operators with Potential Terms on Networks
Abstract and Applied Analysis, 2014 We address some forward and inverse problems involving indefinite eigenvalues for discrete p-Laplacian operators with potential terms. These indefinite eigenvalues are the discrete analogues of p-Laplacians on Riemannian manifolds with potential terms ...
Jea-Hyun Park, Soon-Yeong Chung
doaj +1 more source
Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
Discussiones Mathematicae Graph Theory, 2022 Given a signed graph Ġ, let AĠ and DG˙±D_{\dot G}^ \pm denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of Ġ is defined to be NG˙=DG˙±-AG˙{N_{\dot G}} = D_{\dot G}^ \pm - {A_{\dot
Stanić Zoran
doaj +1 more source
Complexity, 2022 Let Hn be the linear heptagonal networks with 2n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of Hn, we utilize the method of decompositions. Thus, the Laplacian
Jia-Bao Liu +3 more
doaj +1 more source
Some improved bounds on two energy-like invariants of some derived graphs
Open Mathematics, 2019 Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
Simplicial matrix-tree theorems [PDF]
, 2008 We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai.
Duval, Art M. +2 more
core +5 more sources
Nordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues [PDF]
The Electronic Journal of Combinatorics, 2014 Let $G$ be a graph with $n$ vertices. We denote the largest signless Laplacian eigenvalue of $G$ by $q_1(G)$ and Laplacian eigenvalues of $G$ by $\mu_1(G)\ge\cdots\ge\mu_{n-1}(G)\ge\mu_n(G)=0$. It is a conjecture on Laplacian spread of graphs that $\mu_1(G)-\mu_{n-1}(G)\le n-1$ or equivalently $\mu_1(G)+\mu_1(\overline G)\le2n-1$.
Ashraf, F., Tayfeh-Rezaie, B.
openaire +3 more sources
Spectral Results on Some Hamiltonian Properties of Graphs [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian ...
Rao Li
doaj
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
The dual eigenvalue problems for p-Laplacian [PDF]
Acta Mathematica Hungarica, 2013 19 ...
Cheng, Yan-Hsiou +2 more
openaire +3 more sources
Spectral distributions of adjacency and Laplacian matrices of random graphs
, 2010 In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices;
Ding, Xue, Jiang, Tiefeng
core +1 more source