PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 5, 2026Filomat0 citationsOpen Access

C* (X) from a graphical point of view

SCShamik ChatterjeeRSRitu Sen

Key Points

  • This work aims to define and explore the properties of the chain-link graph C*(X) associated with bounded continuous functions on Tychonoff space X.
  • Defined the chain-link graph C*(X) on the set of bounded continuous functions.
  • Examined properties such as connectedness, diameter, and cycles of the graph and its subgraphs.
  • Investigated the relationship between ideals of C*(X) and cliques of C*(X).
  • Characterized all maximal cliques and proved the existence of at least 2^c distinct maximal cliques.
  • Identified that maximal cliques are not graph isomorphic to each other.
  • Established a correspondence between graph isomorphisms on C*(X), ring isomorphisms on C*(X), and homeomorphisms on X based on topology.

Abstract

In this paper, we define a graph called the chain-link graph ?(C*(X)) on the ring C*(X) of all real-valued, bounded, continuous functions defined over a Tychonoff space X. We briefly study some aspects like connectedness, diameter, radius, cycles, chords, dominating sets etc. of ?(C*(X)) and some of its subgraphs. We also inspect the relation between the ideals of C* (X) and the cliques of ?(C*(X)) and finally provide a characterization for all maximal cliques of ?(C*(X)). In the sequel, we prove that there are at least 2c many different maximal cliques, which are never graph isomorphic to each other. Moreover, we inquire about the topological and algebraic notions linked to the neighbourhood of a vertex of the graph. We then observe the correspondence between graph isomorphisms on ?(C*(X)), ring isomorphisms on C*(X) and homeomorphims on X when the topology of X is suitably chosen.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Chatterjee et al. (2025) studied this question.

synapsesocial.com/papers/69a91d8dd6127c7a504c0705https://doi.org/10.2298/fil2519665c
Ask AI
Helpful
Bookmark
Share
View Full Paper