Inverse Problem for Sigma Index

dc.contributor.authorGutman, Ivan
dc.contributor.authorTogan, Muge
dc.contributor.authorYurttas, Aysun
dc.contributor.authorCevik, Ahmet Sinan
dc.contributor.authorCangul, Ismail Naci
dc.date.accessioned2020-03-26T19:54:24Z
dc.date.available2020-03-26T19:54:24Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIf 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.en_US
dc.description.sponsorshipUludag UniversityUludag University [F-2015/17]en_US
dc.description.sponsorshipThis work was supported by the research fund of Uludag University project no F-2015/17.en_US
dc.identifier.endpage508en_US
dc.identifier.issn0340-6253en_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage491en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/36724
dc.identifier.volume79en_US
dc.identifier.wosWOS:000426139900019en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUNIV KRAGUJEVAC, FAC SCIENCEen_US
dc.relation.ispartofMATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRYen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.titleInverse Problem for Sigma Indexen_US
dc.typeArticleen_US

Dosyalar