Advertisement

Graphs and Combinatorics

, Volume 10, Issue 2–4, pp 305–310 | Cite as

Graphoidal bipartite graphs

  • S. Arumugam
  • C. Pakkiam
Article

Abstract

A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths inG such that every path in ψ has at least two vertices, every vertex ofG is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. Let Ω (ψ) denote the intersection graph of ψ. A graph G is said to be graphoidal if there exists a graphH and a graphoidal cover ψof H such that G is isomorphic to Ω(ψ). In this paper we study the properties of graphoidal graphs and obtain a forbidden subgraph characterisation of bipartite graphoidal graphs.

Keywords

Bipartite Graph Intersection Graph Complete Bipartite Graph Internal Vertex Terminal Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Acharya, B. Devadas, Sampathkumar, E.; Graphoidal covers and graphoidal covering number of a graph. Indian J. pure appl. Math.18, 882–890 (1987)MATHMathSciNetGoogle Scholar
  2. 2.
    Harary, F.; Graph Theory, Addison Wesley (1972)Google Scholar
  3. 3.
    Pakkiam, C., Arumugam, S.; On the graphoidal covering number of a graph. Indian J. pure appl. Math.20, 330–333 (1989)MATHMathSciNetGoogle Scholar
  4. 4.
    Pakkiam, C., Arumugam, S.; On graphoidal graphs of a tree. Indian J. pure appl. Math.21, 1055–1058(1990)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • S. Arumugam
    • 1
  • C. Pakkiam
    • 2
  1. 1.Department of MathematicsManonmaniam Sundaranar UniversityTirunelveliIndia
  2. 2.V.O.C. CollegeTuticorinIndia

Personalised recommendations