Results 31 to 40 of about 168,009,036 (204)
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
On the Energy of Unitary Cayley Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 In this note we obtain the energy of unitary Cayley graph $X_{n}$ which extends a result of R. Balakrishnan for power of a prime and also determine when they are hyperenergetic. We also prove that ${E(X_{n})\over 2(n-1)}\geq{2^{k}\over 4k}$, where $k$ is the number of distinct prime divisors of $n$.
Ramaswamy, H. N., Veena, C. R.
openaire +2 more sources
Skew equienergetic digraphs [PDF]
Transactions on Combinatorics, 2016 Let $D$ be a digraph with skew-adjacency matrix $S(D)$. The skew energy of $D$ is defined as the sum of the norms of all eigenvalues of $S(D)$. Two digraphs are said to be skew equienergetic if their skew energies are equal. We establish an
Harishchandra S. Ramane +3 more
doaj
Comparing energy and Randic energy
Macedonian Journal of Chemistry and Chemical Engineering, 2013 The recently conceived Randić energy (RE) is examined, and its relation to the (earlier much studied) total π-electron energy (E) is investigated. Within classes of molecular graphs, there exists a relatively good (increasing) linear correlation between ...
Boris Furtula, Ivan Gutman
doaj +1 more source
Bounds on graph energy and Randic energy
Discrete Mathematics Letters, 2021 Summary: In the present paper, new lower and upper bounds on energy and Randić energy of non-singular (bipartite) graphs are reported. Additionally, it is shown that the obtained lower bounds are stronger than two previously known lower bounds in the literature.
openaire +3 more sources
Journal for Research in Applied Sciences and Biotechnology, 2023 By given the adjacency matrix, laplacian matrix of a graph we can find the set of eigenvalues of graph in order to discussed about the energy of graph and laplacian energy of graph. (i.e. the sum of eigenvalues of adjacency matrix and laplacian matrix of a graph is called the energy of graph) and the laplacian energy of graph is greater or equal to ...
Najibullah Yousefi +2 more
openaire +1 more source
More hyperenergetic molecular graphs [PDF]
Journal of the Serbian Chemical Society, 2000 If G is a molecular graph and l1, l2, ..., ln are its eigenvalues, then the energy of G is equal to E(G) = |l1| + |l2| + ... + |ln|. This energy cannot exceed the value . The graph G is said to be hyperenergetic if E(G) >> 2n - 2.
IVAN GUTMAN +3 more
doaj
Research and Application of Hypernetwork Energy
Jisuanji kexue yu tansuo, 2021 Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
doaj +1 more source
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
Mathematical Notes, 2006 In the present paper we introduce Mobius energy for the embedded graphs and formulate its main properties. This energy is invariant under the action of the group generated by all inversions in three-dimensional real space. We study critical configurations for the angles at vertices of degree less than five, and discuss the techniques of construction of
openaire +3 more sources