On uniformly geodetic graphs

J.H. Koolen

doi:10.1007/BF02988320

On uniformly geodetic graphs

J.H. Koolen

Mathematics and Computer Science

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

8 Citaten (Scopus)

Samenvatting

In this paper we study uniformly geodetic graphs. We shall give a diameter bound for these graphs. Further we characterize bipartite uniformly geodetic graphs and give some examples of them. In the last section we give two constructions and give sufficient conditions to assure that we get uniformly geodetic graphs from these constructions.

Originele taal-2	Engels
Pagina's (van-tot)	325-333
Tijdschrift	Graphs and Combinatorics
Volume	9
Nummer van het tijdschrift	4
DOI's	https://doi.org/10.1007/BF02988320
Status	Gepubliceerd - 1993

Toegang tot document

10.1007/BF02988320

Citeer dit

@article{c558096b04fd44ca9bdac9349c0551cc,

title = "On uniformly geodetic graphs",

abstract = "In this paper we study uniformly geodetic graphs. We shall give a diameter bound for these graphs. Further we characterize bipartite uniformly geodetic graphs and give some examples of them. In the last section we give two constructions and give sufficient conditions to assure that we get uniformly geodetic graphs from these constructions.",

author = "J.H. Koolen",

year = "1993",

doi = "10.1007/BF02988320",

language = "English",

volume = "9",

pages = "325--333",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - On uniformly geodetic graphs

AU - Koolen, J.H.

PY - 1993

Y1 - 1993

N2 - In this paper we study uniformly geodetic graphs. We shall give a diameter bound for these graphs. Further we characterize bipartite uniformly geodetic graphs and give some examples of them. In the last section we give two constructions and give sufficient conditions to assure that we get uniformly geodetic graphs from these constructions.

AB - In this paper we study uniformly geodetic graphs. We shall give a diameter bound for these graphs. Further we characterize bipartite uniformly geodetic graphs and give some examples of them. In the last section we give two constructions and give sufficient conditions to assure that we get uniformly geodetic graphs from these constructions.

U2 - 10.1007/BF02988320

DO - 10.1007/BF02988320

M3 - Article

SN - 0911-0119

VL - 9

SP - 325

EP - 333

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

ER -

On uniformly geodetic graphs

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit