Inverse Problem for Sigma Index
Küçük Resim Yok
Tarih
2018
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
UNIV KRAGUJEVAC, FAC SCIENCE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
If G is a (molecular) graph and d(v), the degree of its vertex u, then its sigma index is defined as sigma(G) = Sigma(d(u) - d(v))(2), with summation going over all pairs of adjacent vertices. Some basic properties of sigma(G) are established. The inverse problem for topological indices is about the existence of a graph having its index value equal to a given non-negative integer. We study the problem for the sigma index and first show that sigma(G) is an even integer. Then we construct graph classes in which sigma(G) covers all positive even integers. We also study the inverse problem for acyclic, unicyclic, and bicyclic graphs.
Açıklama
Anahtar Kelimeler
Kaynak
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
WoS Q Değeri
Q2
Scopus Q Değeri
Q1
Cilt
79
Sayı
2
