A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H).
A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H).
A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H).
People also ask
Which graphs are Cayley graphs?
How to draw a Cayley graph?
What are the properties of a Cayley graph?
Is every Cayley graph vertex transitive?
Aug 19, 2020 · Abstract. A subset C of the vertex set of a graph Γ is called a perfect code of Γ if every vertex of Γ is at distance no more than one to ...
Jan 28, 2022 · In this paper, we give some necessary and sufficient conditions for a subset of A A to be a perfect code of a given Cayley sum graph of A A . We ...
Dec 26, 2017 · In this paper we present a characterization on connected simple Cayley graph \Gamma={\rm Cay}(G,S) having PST.
Given a graph Γ , a subset C of V ( Γ ) is called a perfect code in Γ if every vertex of Γ is at distance no more than one to exactly one vertex in C ...
Aug 11, 2022 · A subset C of G is called a perfect code of G, when there exists a Cayley graph Γ of G such that C is a perfect code of Γ .
The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing expander graphs. The Cayley graph of the free group on two ...
This paper studies perfect codes and total perfect codes in Cayley graphs, with a focus on the following themes: when a subgroup of a given group is a ...