Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorKumar, U. Vijaya Chandraen_US
dc.contributor.authorMurali, R.en_US
dc.contributor.authorGirisha, A.en_US
dc.date.accessioned2020-11-05T11:27:36Z
dc.date.available2020-11-05T11:27:36Z
dc.date.issued2020
dc.identifier.citationKumar, U. V. C., Murali, R. & Girisha, A. (2020). Edge domination in some brick product graphs. TWMS Journal of Applied and Engineering Mathematics, 10(1), 173-180.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2803
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/104-vol10no1/502
dc.description.abstractLet G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E ? F is adjacent to at least one edge in F. The edge domination number ?? (G) of G is the minimum cardinality of an edge dominating set of G. The shadow graph of G, denoted D?(G) is the graph constructed from G by taking two copies of G, say G itself and G? and joining each vertex u in G to the neighbors of the corresponding vertex u? in G?. Let D be the set of all distinct pairs of vertices in G and let Ds (called the distance set) be a subset of D. The distance graph of G, denoted by D(G, Ds) is the graph having the same vertex set as that of G and two vertices u and v are adjacent in D(G, Ds) whenever d(u, v) ? Ds. In this paper, we determine the edge domination number of the shadow distance graph of the brick product graph C(2n, m, r).en_US
dc.description.uriPublisher's Versionen_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.subjectDominating seten_US
dc.subjectBrick product graphen_US
dc.subjectEdge domination numberen_US
dc.subjectMinimal edge dominating seten_US
dc.subjectShadow distance graphen_US
dc.titleEdge domination in some brick product graphsen_US
dc.typeArticleen_US
dc.identifier.volume10
dc.identifier.issue1
dc.identifier.startpage173
dc.identifier.endpage180
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