Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorSundareswaran, Ramanen_US
dc.contributor.authorSwaminathan, Venkatasubramanianen_US
dc.date.accessioned2020-10-05T13:25:03Z
dc.date.available2020-10-05T13:25:03Z
dc.date.issued2015
dc.identifier.citationSundareswaran, R. & Swaminathan, V. (2015). Distance majorization sets in graphs. TWMS Journal of Applied and Engineering Mathematics, 5(1), 118-123.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2554
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/89-vol5no1/204
dc.description.abstractLet G = (V, E) be a simple graph. A subset D of V (G) is said to be a distance majorization set (or dm - set) if for every vertex u ? V ? D, there exists a vertex v ? D such that d(u, v) ? deg(u) + deg(v). The minimum cardinality of a dm - set is called the distance majorization number of G (or dm - number of G) and is denoted by dm(G), Since the vertex set of G is a dm - set, the existence of a dm – set in any graph is guaranteed. In this paper, we find the dm - number of standard graphs like Kn, K1,n, Km,n, Cn, Pn, compute bounds on dm? number and dm- number of self complementary graphs and mycielskian of graphs.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.subjectDistanceen_US
dc.subjectDiameteren_US
dc.subjectDegreeen_US
dc.titleDistance majorization sets in graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume5
dc.identifier.issue1
dc.identifier.startpage118
dc.identifier.endpage123
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