Skip to main content
SpringerLink
Log in

Bigeodetic graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Bigeodetic graphs, a generalization of geodetic and interval-regular graphs, are defined as graphs in which each pair of vertices has at most two paths of minimum length between them. The block cut-vertex incidence pattern of bigeodetic separable graphs are discussed. Two characterizations of bigeodetic graphs are given and some properties of these graphs are studied. Construction of planar bigeodetic blocks with given girth and diameter, and construction of hamiltonian and eulerian/nonhamiltonian and noneulerian, perfect bigeodetic blocks are discussed. The extremal bigeodetic graph of diameterd onp ≥ d + 1 vertices is constructed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bandelt, H.J., Mulder, H.M.: Interval-regular graphs of diameter two. Discrete Math.50, 117–134 (1984)

    Google Scholar 

  2. Bosak, J.: Geodetic Graphs. CombinatoricaI, 151–172 (1978)

    Google Scholar 

  3. Harary, F.: Graph Theory. Reading: Addision-Wesley 1969

    Google Scholar 

  4. Ore, O.: Theory of Graphs. Providence, RI: AMS 1962

    Google Scholar 

  5. Parthasarathy, K.R., Srinivasan, N.: An extremal problem in geodetic graphs. Discrete Math.49, 151–159 (1984)

    Google Scholar 

  6. Parthasarathy, K.R., Srinivasan, N.: Some general constructions of geodetic blocks. J. Comb. Theory (B)33, 121–136 (1982)

    Google Scholar 

  7. Parthasarathy, K.R., Srinivasan, N.: Geodetic blocks of diameter three. Combinatorica4, 197–206 (1984)

    Google Scholar 

  8. Plesnik, J.: A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. J. Comb. Theory (B)36, 284–297 (1984)

    Google Scholar 

  9. Plesnik, J.: Two constructions of geodetic graphs. Math. Slovaca27, 65–71 (1977)

    Google Scholar 

  10. Stemple, J.G.: Geodetic graphs of diameter two. J. Comb. Theory (B)17, 266–280 (1974)

    Google Scholar 

  11. Hic, P.: A Construction of geodetic blocks. Math. Slovaca35, 251–261 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Concordia University, 1455 de Maisonneuve Blvd., H3G 1M8, West, Montreal, Quebec, Canada

    J. Opatrny & V. S. Alagar

Authors
  1. N. Srinivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Opatrny
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. S. Alagar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

On leave from A.M. Jain College, Madras University, Madras 600114, India

Rights and permissions

Reprints and permissions

About this article

Cite this article

Srinivasan, N., Opatrny, J. & Alagar, V.S. Bigeodetic graphs. Graphs and Combinatorics 4, 379–392 (1988). https://doi.org/10.1007/BF01864174

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01864174

Keywords

Search

Navigation