Show simple item record

dc.contributor.authorMathad, Veenaen_US
dc.contributor.authorKhalaf, Shadi Ibrahimen_US
dc.contributor.authorRaikar, Vidyaen_US
dc.date.accessioned2022-10-04T18:09:26Z
dc.date.available2022-10-04T18:09:26Z
dc.date.issued2022
dc.identifier.citationMathad, V., Khalaf, S. I. & Raikar, V. (2022). Neighborhub number of graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(4), 1349-1355.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttps://hdl.handle.net/11729/4946
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/117-vol12no4/918
dc.description.abstractLet G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that for any pair of vertices outside of S, there is a path between them with all intermediate vertices in S and G = S Uv?S < N[v] >. The neighborhub number (n-hub number) hn(G) is then defined to be the size of a smallest neighborhub set of G. In this paper, the neighborhub number for several classes of graphs is computed, bounds in terms of other graph parameters are also determined.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectNeighborhood numberen_US
dc.subjectConnected neighborhood numberen_US
dc.subjectHub numberen_US
dc.subjectTotal hub numberen_US
dc.subjectNeighborhub numberen_US
dc.titleNeighborhub number of graphsen_US
dc.typeArticleen_US
dc.identifier.volume12
dc.identifier.issue4
dc.identifier.startpage1349
dc.identifier.endpage1355
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.indekslendigikaynakEmerging Sources Citation Index (ESCI)en_US
dc.indekslendigikaynakMathScineten_US
dc.indekslendigikaynakScopusen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess