Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorTitus, Prittyen_US
dc.contributor.authorGanesamoorthy, Kathiresanen_US
dc.date.accessioned2021-11-01T12:51:46Z
dc.date.available2021-11-01T12:51:46Z
dc.date.issued2021
dc.identifier.citationTitus, P. & Ganesamoorthy, K. (2021). On the connected detour monophonic number of a graph. TWMS Journal Of Applied And Engineering Mathematics, 11(4), 966-974.en_US
dc.identifier.issn2146-1147
dc.identifier.issn2587-1013
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3246
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/113-vol11-no4/756
dc.description.abstractFor a connected graph G = (V, E) of order at least two, a connected detour monophonic set S of G is called a minimal connected detour monophonic set if no proper subset of S is a connected detour monophonic set of G. The upper connected detour monophonic number of G, denoted by dm+c (G), is defined as the maximum cardinality of a minimal connected detour monophonic set of G. We determine bounds for it and find the same for some special classes of graphs. For any three positive integers a, b and n with 6 ≤ a ≤ n ≤ b, there is a connected graph G with dmc(G) = a, dm+c (G) = b and a minimal connected detour monophonic set of cardinality n.en_US
dc.description.sponsorshipThe first author’s research has been supported by DST Project No. SR/S4/MS:570/09.en_US
dc.description.sponsorshipThe second author’s research has been supported by NBHM. Project no: NBHM / R. P. 29/2015 / Fresh / 157.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_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.subjectConnected detour monophonic numberen_US
dc.subjectConnected detour monophonic seten_US
dc.subjectDetour monophonic seten_US
dc.subjectMinimal connected detour monophonic seten_US
dc.subjectUpper connected detour monophonic numberen_US
dc.titleOn the connected detour monophonic number of a graphen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.relation.journalTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.identifier.volume11
dc.identifier.issue4
dc.identifier.startpage966
dc.identifier.endpage974
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