Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorVaidya, Samir K.en_US
dc.contributor.authorShah, Nirav H.en_US
dc.date.accessioned2020-10-02T08:56:54Z
dc.date.available2020-10-02T08:56:54Z
dc.date.issued2014
dc.identifier.citationVaidya, S. K. & Shah, N. H. (2014). Domination integrity of total graphs. TWMS Journal of Applied and Engineering Mathematics, 4(1), 117-126.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2526
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/81-vol4no1/110
dc.description.abstractThe domination integrity of a simple connected graph G is a measure of vulnerability of a graph. Here we determine the domination integrity of total graphs of path Pn, cycle Cn and star K1,n.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.subjectIntegrityen_US
dc.subjectDomination integrityen_US
dc.subjectTotal graphen_US
dc.titleDomination integrity of total graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume4
dc.identifier.issue1
dc.identifier.startpage117
dc.identifier.endpage126
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess