Abstract
Let be a graph with vertex set and edge set , and be a 0-1 labeling of so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling \emph{edge-friendly}. We say an edge-friendly labeling induces a \emph{partial vertex labeling} if vertices which are incident to more edges labeled 1 than 0, are labeled 1, and vertices which are incident to more edges labeled 0 than 1, are labeled 0. Vertices that are incident to an equal number of edges of both labels we call \emph{unlabeled}. Call a procedure on a labeled graph a \emph{label switching algorithm} if it consists of pairwise switches of labels. Given an edge-friendly labeling of , we show a label switching algorithm producing an edge-friendly relabeling of such that all the vertices are labeled. We call such a labeling \textit{opinionated}.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.