Characterization of Laborde-Mulder graphs (extended odd graphs) (Q1916118): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Rafaï Mourad Madani / rank | |||
Property / author | |||
Property / author: Rafaï Mourad Madani / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4189321 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Another characterization of hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3356336 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Le Nombre D'Absorption Du n–Cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3890733 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interval-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the chromatic number of cube-like graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The chromatic number of extended odd graphs is four / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995122 / rank | |||
Normal rank |
Latest revision as of 13:00, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterization of Laborde-Mulder graphs (extended odd graphs) |
scientific article |
Statements
Characterization of Laborde-Mulder graphs (extended odd graphs) (English)
0 references
2 July 1996
0 references
A graph is \((0, 2)\) if any two vertices have either 0 or 2 neighbors in common. The Laborde-Mulder graph \(E_k\) consists of all subsets of a \(2k- 1\)-element set of cardinality at most \(k- 1\), with an edge between such when they differ by either exactly 1 or \(2k- 2\) elements. This paper proves that any \((0, 2)\)-graph of degree \(d\) on \(2^{d- 1}\) vertices has diameter at least \(\lfloor d/2\rfloor\), with equality for odd \(d\) iff it is a Laborde-Mulder graph.
0 references
diameter
0 references
Laborde-Mulder graph
0 references