Some properties of the Zero-set Intersection graph of $C(X)$ and its Line graph
Yangersenba T Jamir, S Dutta

TL;DR
This paper explores the properties of the zero-set intersection graph of continuous functions on a topological space and its line graph, revealing their connectivity, girth, triangulation, domination number, and algebraic implications.
Contribution
It provides new insights into the structure and properties of zero-set intersection graphs of $C(X)$ and their line graphs, including connectivity, girth, triangulation, and algebraic characterizations.
Findings
Graphs are connected with diameter and radius 2.
Girth of the graphs is 3, and they are triangulated and hypertriangulated.
Characterization of $C(X)$ as a von Neumann regular ring.
Abstract
Let be the ring of all continuous real valued functions defined on a completely regular Hausdorff topological space . The zero-set intersection graph of is a simple graph with vertex set all non units of and two vertices are adjacent if the intersection of the zero sets of the functions is non empty. In this paper, we study the zero-set intersection graph of and its line graph. We show that if has more than two points, then these graphs are connected with diameter and radius 2. We show that the girth of the graph is 3 and the graphs are both triangulated and hypertriangulated. We find the domination number of these graphs and finally we prove that is a von Neuman regular ring if and only if is an almost regular ring and for all there exists such that …
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
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Optimization and Packing Problems
