Results 61 to 70 of about 222 (137)
The association of integers, conjugate pairs, and robustness with the eigenvalues of graphs provides the motivation for the following definitions. A class of graphs, with the property that, for each graph (member) of the class, there exists a pair a, b of nonzero, distinct eigenvalues, whose sum and product are integral, is said to be eigen-bibalanced.
Paul August Winter +2 more
wiley +1 more source
On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
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
On some aspects of the generalized Petersen graph
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
V. Yegnanarayanan
doaj +1 more source
Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan +5 more
wiley +1 more source
Energy Conditions for Hamiltonicity of Graphs
Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G) ≤ μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n |μi(G)|. Denote by GBPT a bipartite graph. In this paper, we establish the sufficient conditions for G having a Hamiltonian path or cycle or to be Hamilton‐connected in terms ...
Guidong Yu +4 more
wiley +1 more source
On two energy-like invariants of line graphs and related graph operations
For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
doaj +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
An Intuitionistic Fuzzy Graph’s Signless Laplacian Energy
We are extending concept into the Intuitionistic fuzzy graph’ Signless Laplacian energy instead of the Signless Laplacian energy of fuzzy graph. Now we demarcated an Intuitionistic fuzzy graph’s Signless adjacency matrix and also an Intuitionistic fuzzy graph’s Signless Laplacian energy.
Obbu Ramesh, S. Sharief Basha
openaire +2 more sources

