Results 51 to 60 of about 5,566,785 (118)
International Journal of Quantum Chemistry, Volume 124, Issue 11, June 5, 2024.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
Discrete Dynamics in Nature and Society, Volume 2014, Issue 1, 2014., 2014 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
The Signless Laplacian Matrix of Hypergraphs [PDF]
, 2019 In this paper we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix with structural parameters of the hypergraph ...
Trevisan, Vilmar, Cardoso, Kauê
core +1 more source
On two energy-like invariants of line graphs and related graph operations
Journal of Inequalities and Applications, 2016 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
Mathematische Nachrichten, Volume 297, Issue 5, Page 1749-1771, May 2024.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
Sharp Bounds on (Generalized) Distance Energy of Graphs
Mathematics, 2020 Given a simple connected graph G, let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian matrix, D Q ( G ) be the distance signless Laplacian matrix, and T r ( G ) be the vertex transmission ...
Abdollah Alhevaz +3 more
doaj +1 more source
Distance Spectra of Some Double Join Operations of Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.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
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
Some results on signless Laplacian coefficients of graphs [PDF]
, 2012 Let QG(x)=det(xI-Q(G))=∑i=0n(-1)iζixn-i be the characteristic polynomial of the signless Laplacian matrix of a graph G. Due to the nice properties of the signless Laplacian matrix, Q(G), in comparison with the other matrices related to graphs, ζ-ordering,
Mirzakhah, Maryam, Kiani, Dariush
core +1 more source
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