Results 11 to 20 of about 375,055 (299)
On the Incidence Energy of Some Toroidal Lattices [PDF]
Abstract and Applied Analysis, 2014 The incidence energy IE(G), defined as the sum of the singular values of the incidence matrix of G, is a much studied quantity with well known applications in chemical physics.
Jia-Bao Liu, Jinde Cao, Jin Xie
doaj +4 more sources
Bounds for Incidence Energy of Some Graphs [PDF]
Journal of Applied Mathematics, 2013 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
Weizhong Wang, Dong Yang
doaj +5 more sources
On Laplacian-energy-like invariant and incidence energy [PDF]
International Journal of Group Theory, 2015 For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj +3 more sources
The Non-Linear Effects of Energy Efficiency Gains on the Incidence of Energy Poverty [PDF]
Sustainability, 2021 Energy poverty is defined as insufficient access to modern energy resources which are relatively cleaner than the traditionally utilized ones. In this regard, the incidence of energy poverty is particularly higher in the cases of the developing countries across the globe. Accordingly, the chronic energy poverty issues in the developing countries within
Raad Al-Tal +7 more
openaire +4 more sources
, 2014 The incidence energy of a graph is defined as the sum of singular values of its incidence matrix. In this paper, we establish some new bounds on the incidence energy of connected graphs.
Bozkurt, S. Burcu, Bozkurt, Durmus
core +5 more sources
Randi'c incidence energy of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph with vertex set $V(G) = {v_1, v_2,ldots , v_n}$ and edge set $E(G) = {e_1, e_2,ldots , e_m}$. Similar to the Randi'c matrix, here we introduce the Randi'c incidence matrix of a graph $G$, denoted by $I_R(G)$, which is defined
Ran Gu, Fei Huang, Xueliang Li
doaj +1 more source
On the Diameter and Incidence Energy of Iterated Total Graphs [PDF]
Symmetry, 2018 The total graph of G, T(G) is the graph whose vertex set 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. For k≥2, the k-th iterated total graph of G, Tk(G), is defined recursively as Tk(G)=T(Tk−1(G)), where T1(G)=T(G) and T0(G)=G.
Eber Lenes +2 more
exaly +3 more sources
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Ch., Gutman, Ivan
openaire +2 more sources
On incidence energy of a graph
Linear Algebra and its Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutman, Ivan +3 more
openaire +3 more sources
On the oriented incidence energy and decomposable graphs [PDF]
Filomat, 2009 Let G be a simple graph with n vertices and m edges. Let edges of G be given an arbitrary orientation, and let Q be the vertex-edge incidence matrix of such oriented graph. The oriented incidence energy of G is then the sum of singular values of Q.
Dragan Stevanovic +4 more
openaire +2 more sources