Show simple item record

On even-odd meanness of super subdivision of some graphs

dc.creatorBasher, Mohamed
dc.creatorSiddiqui, Muhammad Kamran
dc.date2022-09-27
dc.date.accessioned2022-11-15T12:37:10Z
dc.date.available2022-11-15T12:37:10Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5302
dc.identifier10.22199/issn.0717-6279-5302
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/215689
dc.descriptionGraph Labeling is a significant area of graph theory that is used in a variety of applications like coding hypothesis, x-beam crystallography, radar, cosmology, circuit design, correspondence network tending to, and database administration. This study provides a general overview of graph naming in heterogeneous fields, however it primarily focuses on graph subdivision. The even vertex odd meanness of super subdivide of various graphs is discussed in this study. The graphs generated by super subdivided of path, cycle, comb, crown, and planar grid are even-odd mean graphs, according to our proof.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/5302/4150
dc.rightsCopyright (c) 2022 Mohamed Basher, Muhammad Kamran Siddiquien-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 41 No. 5 (2022); 1213-1228en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 41 Núm. 5 (2022); 1213-1228es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2022-05
dc.subjectlabelingen-US
dc.subjecteven-odd meannessen-US
dc.subjectbiographen-US
dc.subjectsuper subdivisionen-US
dc.subject05C78en-US
dc.titleOn even-odd meanness of super subdivision of some graphsen-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