Graphs without dead ends
type: Item
instance of: scholarly article
title: Graphs without dead ends
zbMATH Open document ID: 0842.05028
author: G. Sabidussi
published in: European Journal of Combinatorics
publication date: 1996-07-17T00:00:00Z
review text: The author studies antipodal graphs, i.e. such graphs \(G\) that for any vertex \(u\) of \(G\) there exists a vertex \(\overline u\) of \(G\) such that \(d(u, x)+ d(x, \overline u)= d(u, \overline u)\) for all \(x\in V(G)\). In these graphs, for a given \(u\), there exists exactly one antipode \(\overline u\) with \(d(u, \overline u)= d(G)\). The author characterizes these graphs and discusses properties of the graphs such as degree, girth, and automorphism. He illustrates them with numerous interesting examples.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 847631
zbMATH Keywords: dead ends
zbMATH Keywords: distance
zbMATH Keywords: antipodal graphs
reviewed by: Ferdinand Gliviak
MaRDI profile type: Publication
full work available at URL: eujc.1996.0006
OpenAlex ID: W2042384921
DOI: 10.1006/EUJC.1996.0006
Recommended article: Graphs without spanning closed trails
Recommended article: Ends of graphs
Recommended article: Q5251896
Recommended article: Q3972099
Recommended article: Q3179061
Recommended article: Q4405660
Recommended article: Graphs without four-cycles
Recommended article: Connected graphs without long paths
Recommended article: Directed Graphs Without Short Cycles
description: scientific article; zbMATH DE number 847631