Yayın:
The pivot number f a graph

Basit Görünüm
dc.contributor.authorKhalaf, S.I.
dc.contributor.authorMathad, V.
dc.contributor.authorMahde, S.S.
dc.contributor.authorCangul, I.N.
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentFen Edebiyat Fakültesi
dc.contributor.departmentMatematik Ana Bilim Dalı
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.scopusid57189022403
dc.date.accessioned2025-05-13T06:43:01Z
dc.date.issued2022-01-01
dc.description.abstractFor a graph G having at least one edge, the minimum number of edges which we can remove from G such that the resulting graph has hub number larger than the hub number of G is called the pivot number p{G) of G. The values of pivot number for several classes of graphs are computed, and we determine the pivot number of join and corona products. Also some bounds for this parameter are obtained.
dc.identifier.doi10.17777/pjms2022.25.2.185
dc.identifier.endpage194
dc.identifier.issn1598-7264
dc.identifier.issue2
dc.identifier.scopus2-s2.0-85130387274
dc.identifier.startpage185
dc.identifier.urihttps://hdl.handle.net/11452/51767
dc.identifier.volume25
dc.indexed.scopusScopus
dc.language.isoen
dc.publisherJangjeon Research Institute for Mathematical Sciences and Physics
dc.relation.journalProceedings of the Jangjeon Mathematical Society
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectPivot number
dc.subjectNetwork
dc.subjectHub number
dc.subjectGraph
dc.subject.scopusCardinality; Dominating Set; Polynomial
dc.titleThe pivot number f a graph
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentFen Edebiyat Fakültesi/Matematik Ana Bilim Dalı
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Dosyalar

Koleksiyonlar

İndeksli Yayınlar / Indexed Publications