Show simple item record

Vertex cover and Edge vertex domination in trees

dc.creatorSenthilkumar, B.
dc.creatorNaresh Kumar, H.
dc.creatorVenkatakrishnan, Y. B.
dc.date2021-09-29
dc.date.accessioned2021-10-04T15:13:01Z
dc.date.available2021-10-04T15:13:01Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3532
dc.identifier10.22199/issn.0717-6279-3532
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/177040
dc.descriptionLet G = (V,E) be a simple graph. An edge e ∈ E(G) edge-vertex dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. A subset D ⊆ E(G) is an edge-vertex dominating set of a graph G if every vertex of G is edge-vertex dominated by an edge of D. A vertex cover of G is a set C ⊆ V such that for each edge uv ∈ E at least one of u and v is in C. We characterize trees with edge-vertex domination number equals vertex covering number.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3532/3890
dc.rightsCopyright (c) 2021 B. Senthilkumar, H. Naresh Kumar, Y. B. Venkatakrishnanen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 40 No. 5 (2021); 1147-1154en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 40 Núm. 5 (2021); 1147-1154es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2021-05
dc.subjectEdge vertex dominating seten-US
dc.subjectVertex coveren-US
dc.subjectTreesen-US
dc.subject05C69en-US
dc.subject05C70en-US
dc.titleVertex cover and Edge vertex domination in treesen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record