Spherical and clockwise spherical graphs
Abdelhafid Berrachedi; Ivan Havel; Henry Martyn Mulder
Czechoslovak Mathematical Journal (2003)
- Volume: 53, Issue: 2, page 295-309
- ISSN: 0011-4642
Access Full Article
top
Abstract
topHow to cite
topBerrachedi, Abdelhafid, Havel, Ivan, and Mulder, Henry Martyn. "Spherical and clockwise spherical graphs." Czechoslovak Mathematical Journal 53.2 (2003): 295-309. <http://eudml.org/doc/30778>.
@article{Berrachedi2003,
abstract = {The main subject of our study are spherical (weakly spherical) graphs, i.e. connected graphs fulfilling the condition that in each interval to each vertex there is exactly one (at least one, respectively) antipodal vertex. Our analysis concerns properties of these graphs especially in connection with convexity and also with hypercube graphs. We deal e.g. with the problem under what conditions all intervals of a spherical graph induce hypercubes and find a new characterization of hypercubes: $G$ is a hypercube if and only if $G$ is spherical and bipartite.},
author = {Berrachedi, Abdelhafid, Havel, Ivan, Mulder, Henry Martyn},
journal = {Czechoslovak Mathematical Journal},
keywords = {spherical graph; hypercube; antipodal vertex; interval; spherical graph; hypercube; antipodal vertex; interval},
language = {eng},
number = {2},
pages = {295-309},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Spherical and clockwise spherical graphs},
url = {http://eudml.org/doc/30778},
volume = {53},
year = {2003},
}
TY - JOUR
AU - Berrachedi, Abdelhafid
AU - Havel, Ivan
AU - Mulder, Henry Martyn
TI - Spherical and clockwise spherical graphs
JO - Czechoslovak Mathematical Journal
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 53
IS - 2
SP - 295
EP - 309
AB - The main subject of our study are spherical (weakly spherical) graphs, i.e. connected graphs fulfilling the condition that in each interval to each vertex there is exactly one (at least one, respectively) antipodal vertex. Our analysis concerns properties of these graphs especially in connection with convexity and also with hypercube graphs. We deal e.g. with the problem under what conditions all intervals of a spherical graph induce hypercubes and find a new characterization of hypercubes: $G$ is a hypercube if and only if $G$ is spherical and bipartite.
LA - eng
KW - spherical graph; hypercube; antipodal vertex; interval; spherical graph; hypercube; antipodal vertex; interval
UR - http://eudml.org/doc/30778
ER -
References
top- 10.1016/0012-365X(88)90010-6, Discrete Math. 69 (1988), 107–114. (1988) MR0937775DOI10.1016/0012-365X(88)90010-6
- Private communication, .
- Distance-regular graphs. A Series of Modern Surveys in Mathematics, Springer Verlag, Berlin-Heidelberg-New York, 1989. (1989) MR1002568
- Hasse Graphen spezieller Ordnungen, In: K. Wagner, R. Bodendiek: Graphentheorie I. Anwendungen auf Topologie, Gruppentheorie und Verbandstheorie, B. I, Wissenschaftsverlag, Mannheim-Wien-Zurich, 1989, pp. 157–235. (1989)
- 10.1016/0012-365X(92)90696-D, Discrete Math. 110 (1992), 9–16. (1992) MR1197441DOI10.1016/0012-365X(92)90696-D
- Four difficult unsolved problems in graph theory, Recent Advances in Graph Theory, M. Fiedler (ed.), Academia, Praha, 1974, pp. 249–256. (1974) MR0382042
- 10.1016/0012-365X(93)90064-Z, Discrete Math. 118 (1993), 233–237. (1993) Zbl0784.05040MR1230065DOI10.1016/0012-365X(93)90064-Z
- The interval function of a graph, Mathematical Centre Tracts 132, Mathematisch Centrum Amsterdam, 1980. (1980) Zbl0446.05039MR0605838
- 10.1016/0012-365X(82)90021-8, Discrete Math. 44 (1982), 253–269. (1982) Zbl0542.05051MR0676887DOI10.1016/0012-365X(82)90021-8
- Private communication, .
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.