Results 31 to 40 of about 1,416,244 (110)
Orderenergetic, hypoenergetic and equienergetic graphs resulting from some graph operations [PDF]
A graph G is said to be orderenergetic, if its energy is equal to its order and it is said to be hypoenergetic if its energy is less than its order. Two non-isomorphic graphs of same order are said to be equienergetic if their energies are equal. In this
T. Jahfar, A. Chithra
semanticscholar +1 more source
A graph product and its applications in generating non-cospectral equienergetic graphs
A new graph product is defined in this paper and several applications of this product are described. The adjacency matrix of the product graph is given and its complete spectrum in terms of the spectrum of constituent graphs is determined.
S. Joseph
semanticscholar +1 more source
On complementary equienergetic strongly regular graphs [PDF]
Summary: The energy of a graph is the sum of absolute values of the eigenvalues of its adjacency matrix. Two graphs are said to be equienergetic if they have same energy. A graph is said to be complementary equienergetic if it is equienergetic with its complement.
Harishchandra S. Ramane +4 more
doaj +2 more sources
Vertex‐Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph
A measurement of the molecular topology of graphs is known as a topological index, and several physical and chemical properties such as heat formation, boiling point, vaporization, enthalpy, and entropy are used to characterize them. Graph theory is useful in evaluating the relationship between various topological indices of some graphs derived by ...
Muhammad Asad Ali +4 more
wiley +1 more source
New Results on Zagreb Energy of Graphs
Let G be a graph with vertex set V(G) = {v1, …, vn}, and let di be the degree of vi. The Zagreb matrix of G is the square matrix of order n whose (i, j)‐entry is equal to di + dj if the vertices vi and vj are adjacent, and zero otherwise. The Zagreb energy ZE(G) of G is the sum of the absolute values of the eigenvalues of the Zagreb matrix.
Seyed Mahmoud Sheikholeslami +3 more
wiley +1 more source
Construction of equienergetic and Randic' equienergetic graphs
In this paper, we give several constructions for the pairs of graphs to be equienergetic and Randic' equienergetic graphs. Also, some new families of integral and Randic' integral graphs are obtained. As an application, a sequence of graphs established with reciprocal eigenvalue property and anti-reciprocal eigenvalue property.
Jahfar, T K, Chithra, A V
openaire +2 more sources
An upper bound for difference of energies of a graph and its complement
The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a problem to find best
Harishchandra S. Ramane +2 more
doaj +1 more source
Equienergetic self-complementary graphs [PDF]
summary:In this paper equienergetic self-complementary graphs on $p$ vertices for every $p=4k$, $k \geq 2$ and $p=24t+1$, $t \geq 3$ are ...
Vijayakumar, A. +2 more
core +1 more source
On inverse sum indeg energy of graphs
For a simple graph with vertex set {v1,v2,…,vn}\left\{{v}_{1},{v}_{2},\ldots ,{v}_{n}\right\} and degree sequence dvii=1,2,…,n{d}_{{v}_{i}}\hspace{0.33em}i=1,2,\ldots ,n, the inverse sum indeg matrix (ISI matrix) AISI(G)=(aij){A}_{{\rm{ISI}}}\left(G ...
Jamal Fareeha +2 more
doaj +1 more source
Distance spectra of some double join of graphs and some new families of distance equienergetic graphs [PDF]
In this paper we compute the spectrum of a special block matrix and use it to describe the distance spectra of some double join of graphs.
R., Rakshith B., Manjunatha, B. J.
core +1 more source

