[引用][C] Graph energy
X Li - 2012 - books.google.com
This book is about graph energy. The authors have included many of the important results
on graph energy, such as the complete solution to the conjecture on maximal energy of …
on graph energy, such as the complete solution to the conjecture on maximal energy of …
[HTML][HTML] Distance spectra of graphs: A survey
M Aouchiche, P Hansen - Linear algebra and its applications, 2014 - Elsevier
Abstract In 1971, Graham and Pollack established a relationship between the number of
negative eigenvalues of the distance matrix and the addressing problem in data …
negative eigenvalues of the distance matrix and the addressing problem in data …
Distance-based graphical indices for predicting thermodynamic properties of benzenoid hydrocarbons with applications
S Hayat - Computational Materials Science, 2023 - Elsevier
This paper considers all the commonly occurring distance-related graphical indices and
investigates their potential to predict thermodynamic properties of benzenoid hydrocarbons …
investigates their potential to predict thermodynamic properties of benzenoid hydrocarbons …
Quantitative structure–activity relationship models for ready biodegradability of chemicals
The European REACH regulation requires information on ready biodegradation, which is a
screening test to assess the biodegradability of chemicals. At the same time REACH …
screening test to assess the biodegradability of chemicals. At the same time REACH …
[HTML][HTML] Structure-property modeling for thermodynamic properties of benzenoid hydrocarbons by temperature-based topological indices
Quantitative structure-property relationship (QSPR) modeling employs contemporary
mathematical tools to predict physicochemical, thermodynamic and biological properties of …
mathematical tools to predict physicochemical, thermodynamic and biological properties of …
Randic matrix and Randic energy
ŞB Bozkurt, AD Güngör, I Gutman, AS Cevik - 2010 - acikerisim.selcuk.edu.tr
Özet If G is a graph on n vertices, and d (i) is the degree of its i-th vertex, then the Randic
matrix of G is the square matrix of order n whose (i, j)-entry is equal to 1/root d (i) d (j) di if the …
matrix of G is the square matrix of order n whose (i, j)-entry is equal to 1/root d (i) d (j) di if the …
On vertex-degree-based molecular structure descriptors
If\(G=(\mathbf {V}\\mathbf {E})\) is a molecular graph and\(d_u\) is the degree of vertex\(u\),
then the first and second Zagreb indices are\(\sum_ {u\in\mathbf {V}} d_u^ 2\) and\(\sum …
then the first and second Zagreb indices are\(\sum_ {u\in\mathbf {V}} d_u^ 2\) and\(\sum …
Quality testing of spectrum-based valency descriptors for polycyclic aromatic hydrocarbons with applications
In this paper, we investigate the prediction potential of commonly occurring eigenvalues-
based descriptors which are related to chemical matrices corresponding to valency of …
based descriptors which are related to chemical matrices corresponding to valency of …
[HTML][HTML] Quality testing of spectrum-based distance descriptors for polycyclic aromatic hydrocarbons with applications to carbon nanotubes and nanocones
In this paper, we investigate the predictive potential of commonly occurring spectrum-based
distance descriptors which are based on eigenvalues of distance-related chemical matrices …
distance descriptors which are based on eigenvalues of distance-related chemical matrices …
[PDF][PDF] The minimum covering energy of a graph
In this paper we introduce a new kind of graph energy, the minimum covering energy, Ec
(G). It depends both on the underlying graph G, and on its particular minimum cover C …
(G). It depends both on the underlying graph G, and on its particular minimum cover C …