The generalized S-graphs of diameter 3 (Q1893167): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Ji Xiang Meng / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ferdinand Gliviak / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bipartite Graphs With A Central Symmetry And (1,-1)-Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cross-cloning and antipodal graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3942960 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Even graphs / rank | |||
Normal rank | |||
Latest revision as of 15:09, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The generalized S-graphs of diameter 3 |
scientific article |
Statements
The generalized S-graphs of diameter 3 (English)
0 references
5 September 1995
0 references
The author recalls definitions of S-graphs and generalized S-graphs and gets relations to symmetric graphs and one notion of antipodal graphs (there exist also others). A generalized S-graph of diameter three (shortly 3-GS-graph) is reducible, if it arises from some 3-GS-graph by some L-operation. In opposite case it is said to be irreducible. Among others, the author describes all irreducible 3-GS-graphs.
0 references
distance
0 references
S-graphs
0 references
symmetric graphs
0 references
antipodal graphs
0 references
generalized S- graph
0 references
diameter
0 references
