Results 51 to 60 of about 1,416,244 (110)
Equienergetic net-regular signed graphs [PDF]
International Journal of Contemporary Mathematical Sciences, 2014 The concept of energy is recently generalized to signed graphs i.e. the sum of the absolute values of the eigenvalues of a signed graph . Many authors have constructed non-cospectral equienergeic graphs. In this paper, we established the spectra of heterogeneous unbalanced netregular signed complete graphs. Then, we give a method to construct an innite
openaire +1 more source
On the Extended Adjacency Eigenvalues of Graphs and Applications
MathematicsLet Aex(G) be the extended adjacency matrix of G. The eigenvalues of Aex(G) are called extended adjacency eigenvalues of G. The sum of the absolute values of eigenvalues of the Aex-matrix is called the extended adjacency energy Eex(G) of G. In this paper,
Hilal A. Ganie, Amal Alsaluli
doaj +1 more source
Large sets of long distance equienergetic graphs
Ars Mathematica Contemporanea, 2009 Distance energy of a graph is a recent energy-type invariant, defined as the absolute deviation of the eigenvalues of the distance matrix of the graph. Two graphs of the same order are said to be distance equienergetic if they have equal distance energy, while they have distinct spectra of their distance matrices.
openaire +3 more sources
Harary energy of complement of line graphs of regular graphs
, 2020 The Harary matrix of a graph G is defined as H ( G ) = [ h i j ] , where h i j = 1 d ( v i , v j ) , if i ≠ j and h i j = 0 , otherwise, where d ( v i , v j ) is the distance between the vertices v
Ashoka, K., Ramane, Harishchandra
core +1 more source
More skew-equienergetic digraphs
, 2016 Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices.
Ch. Adiga +1 more
core +1 more source
Minimum Cycle Base of Graphs Identified by Two Planar Graphs [PDF]
, 2007 In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e ...
Han, Ren, Dengju, Ma
core +1 more source
Equienergetic self-complementary graphs
, 2002 In this paper equienergetic self-complementary graphs on p vertices for every p = 4k; k ¸ 2 and p = 24t + 1; t ¸ 3 are ...
Indulal,G, Vijayakumar,Ambat
core
Plick Graphs with Crossing Number 1 [PDF]
, 2011 In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +1 more source
More on Equienergetic Threshold Graphs
, 2018 The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et al. [Eigenvalues and energy in threshold graphs, Linear Algebra Appl.
openaire +2 more sources
Spectra and Energy of Signed Graphs
, 2017 We extend the notion of extended double cover of graphs to signed graphs to find the spectra of unbalanced signed bipartite graphs and also we construct non-cospectral equienergetic signed bipartite ...
Nutan G. Nayak
core +1 more source