A note on binary graph labelings and linear preservers
DOI:
https://doi.org/10.13069/jacodesmath.v11i3.280Keywords:
Binary vertex labeling, Freyberg-Marr labeling, Linear operator, Vertex permutationAbstract
An FM labeling of the vertices of an undirected graph requires that half the neighbors of each vertex are labeled zero and the other half labeled one. Variations of this type of labeling are presented and examples of the smallest and largest of graphs having one of these FM labelings are given. It is also shown that if $T$ is a linear operator on the set of all undirected graphs on $n$ vertices that strongly preserves sets of graphs that are labelable by one of the various FM type labelings, then $T$ is a vertex permutation.
Received: 13 February 2023 | Accepted: 9 September 2023Downloads
References
L. B. Beasley and N. J. Pullman, Linear operators preserving properties of graphs, Congr. Numer. 70 (1990) 105–112.
L. B. Beasley, Cordial digraphs, J. Combin. Math. Combin. Comput. 121(1) (2024) 59–66.
L. B. Beasley, Graph cordiality – Extremes and Preservers, arXiv:2408.13853 (2024).
L. B. Beasley, J. Mousley, M. A. Santana, and D. E. Brown, Cordiality of digraphs, J. Algebra Comb. Discrete Appl. 10(1) (2023) 1–13.
L. B. Beasley and S.-Z. Song, Genus of a graph and its strong preservers, Linear Multilinear Algebra 68(8) (2020) 1655–1662.
I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987) 201–208.
B. Freyberg and A. Marr, Red-blue colorings of graphs, conference presentation, 53rd Southeastern International Conference on Combinatorics, Graph Theory & Computing, Florida Atlantic University (2022).
