Cycles and Paths Related Vertex-Equitable Graphs
Journal of Combinatorial Mathematics and Combinatorial Computing · 2023
DOI: 10.61091/jcmcc117-02 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, 2023. Verfasst von Saima Nazeer und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
A vertex labeling ξ of a graph χ is referred to as a ‘vertex equitable labeling (VEq.)’ if the induced edge weights, obtained by umming the labels of the end vertices, satisfy the following condition: the absolute difference in the number of vertices v and u with labels ξ(v)=a and ξ(u)=b (where a, b∈Z) is approximately 1, considering a given set A that consists of the first ⌈q2⌉ non egative integers. A graph χ that admits a vertex equitable labeling (VEq.) is termed a ‘vertex equitable’ graph. In this manuscript, we have demonstrated that graphs related to cycles and paths are examples of vertex-equitable graphs.
Zitieren
APA
Nazeer, S., Sultana, N., & Bonyah, E. (2023). Cycles and Paths Related Vertex-Equitable Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. https://doi.org/10.61091/jcmcc117-02
Vancouver
Nazeer S, Sultana N, Bonyah E. Cycles and Paths Related Vertex-Equitable Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2023. doi:10.61091/jcmcc117-02
BibTeX
@article{Nazeer2023,
author = {Nazeer, Saima and Sultana, Najma and Bonyah, Ebenezer},
title = {Cycles and Paths Related Vertex-Equitable Graphs},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2023},
doi = {10.61091/jcmcc117-02}
}
EUVIMED