107 citations · 170 across the 7 of their papers we have counts for
8 papers
A Novel Method to Construct NSSD Molecular Graphs
Umar Hayat, Mubasher Umer, Ivan Gutman +2
A graph is said to be NSSD (= non-singular with a singular deck) if it has no eigenvalue equal to zero, whereas all its vertex-deleted subgraphs have eigenvalues equal to zero. NSS…
Splice Graphs and Their Topological Indices
Reza Sharafdini, Ivan Gutman
Let and be two graphs with disjoint vertex sets and . Let and . A splice of and by vertices …
Constructions of graphs and trees with partially prescribed spectrum
Xueliang Li, Wasin So, Ivan Gutman
It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally rea…
Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs
Luiz Emilio Allem, Juliane Capaverde, Vilmar Trevisan +3
The resolvent energy of a graph of order is defined as , where are the eigenvalues of . In a recent work [Gutman et al…
On extremal trees with respect to the -index
Hosam Abdo, Darko Dimitrov, Ivan Gutman
In a study on the structure--dependency of the total -electron energy from 1972, Trinajstić and one of the present authors have shown that it depends on the sums $\sum_{v\in V}d…
Novel Inequalities for Generalized Graph Entropies Revisited, Graph Energies and Topological Indices
Xueliang Li, Zhongmei Qin, Meiqin Wei +2
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to informatio…