Skip to main content
added 14 characters in body
Source Link

Let $G$ be (connected) self-centered graph, i.e. $r(G)=d(G)=m<\infty$.

My question is following

Does $G$ always contains $C_{2m}$ or $C_{2m+1}$ as a subgraph?

Let $G$ be (connected) self-centered graph, i.e. $r(G)=d(G)=m<\infty$.

My question is following

Does $G$ always contains $C_{2m}$ as a subgraph?

Let $G$ be (connected) self-centered graph, i.e. $r(G)=d(G)=m<\infty$.

My question is following

Does $G$ always contains $C_{2m}$ or $C_{2m+1}$ as a subgraph?

Post Undeleted by Sergiy Kozerenko
Post Deleted by Sergiy Kozerenko
added 30 characters in body
Source Link

Let $G$ be connected(connected) self-centered graph, i.e. $r(G)=d(G)=m$$r(G)=d(G)=m<\infty$.

My question is following

Does $G$ always contains $C_{2m}$ as a subgraph?

Let $G$ be connected self-centered graph, i.e. $r(G)=d(G)=m$.

Does $G$ always contains $C_{2m}$ as a subgraph?

Let $G$ be (connected) self-centered graph, i.e. $r(G)=d(G)=m<\infty$.

My question is following

Does $G$ always contains $C_{2m}$ as a subgraph?

Source Link

On cycles in self-centered graphs

Let $G$ be connected self-centered graph, i.e. $r(G)=d(G)=m$.

Does $G$ always contains $C_{2m}$ as a subgraph?