On two problems about (0, 2)-graphs and interval-regular graphs

MaRDI QIDQ2713628zbMATH OpenFDO

Authors Abdelhafid Berrachedi, Michel Mollard

Publication date 10 June 2001

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

\((0,2)\)-graphinterval-monotone graphinterval-regular graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Review text

A \((0,2)\)-graph is a connected graph in which any two distinct vertices have either no common neighbour, or exactly two. An interval-regular graph is a graph in which for any two vertices \(u,v\) the number of neighbours of \(u\) lying on a shortest \((u,v)\)-paths is equal to the distance between \(u\) and \(v\). Graph operations preserving the property of being a \((0,2)\)-graph are studied. The results enable to construct non-vertex-transitive \((0,2)\)-graphs and to construct a family of regular interval-regular graphs which are not interval-monotone. The latter construction disproves a weaker version of a conjecture by H. M. Mulder.

Recommendations

• Interval-regular graphs of diameter two
• Interval-regularity does not lead to interval monotonicity
• Interval-regular graphs
• 4-cycle properties for characterizing rectagraphs and hypercubes.
• Generalized hypercubes and (0, 2)-graphs

Cited in

(5)

• Generalized hypercubes and (0, 2)-graphs
• scientific article; zbMATH DE number 4208116 (Why is no real title available?)
• Generalized hypercube graph \(\mathcal{Q}_n(S)\), graph products and self-orthogonal codes
• Interval-regularity does not lead to interval monotonicity
• Interval-regular graphs of diameter two

This page was built for publication: On two problems about (0, 2)-graphs and interval-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713628)