Fair Sets of Some Class of Graphs
R. Ram Kumar, Kannan Balakrishnan, Prasanth G. Narasimha-Shenoi

TL;DR
This paper introduces the concept of fair sets in graphs, characterizes their properties in specific graph classes, and identifies fair sets in common graph types, advancing understanding of equitable vertex subsets.
Contribution
It defines fair sets based on partiality, proves their connectivity in trees, characterizes block graphs, and identifies fair sets in various standard graphs and their Cartesian products.
Findings
Fair sets induce connected subgraphs in trees.
Block graphs are characterized by connected fair sets.
Fair sets are identified for several standard graph classes.
Abstract
Given a non empty set of vertices of a graph, the partiality of a vertex with respect to is the difference between maximum and minimum of the distances of the vertex to the vertices of . The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of , , , wheel graphs, odd cycles and symmetric even graphs are identified. The fair sets of the Cartesian product graphs are also discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems
