Acyclic graphoidal covers and path partitions in a graph

@article{Arumugam1998AcyclicGC,
  title={Acyclic graphoidal covers and path partitions in a graph},
  author={S. Arumugam and J. Suresh Suseela},
  journal={Discrete Mathematics},
  year={1998},
  volume={190},
  pages={67-77}
}
An acyclic graphoidal cover of a graph G is a collection $ of paths in G such that every path in $ has at least two vertices, every vertex of G is an internal vertex of at most one path in ~/and every edge of G is in exactly one path in $. The minimum cardinality of an acyclic graphoidal cover of G is called the aeyclie graphoidal covering number of G and is denoted by ~/a. A path partition of a graph G is a collection ~ of paths in G such that every edge of G is in exactly one path in ~ . The… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Graphoidal covers of a graph - - a creative review

S. Arumugam, B. D. Acharya, E. Sampathkumar
Tata McGraw-Hill, New Delhi, • 1996
View 1 Excerpt

On the graphoidal coveting number of a graph

S. Arumugam C. Pakkiam
Indian J . Pure Appl . Math . • 1994

The graphoidal coveting number of unicyclic graphs

S. Arumugam C. Pakkiam
Indian J . Pure Appl . Math . • 1989

Further results on the graphoidal covering number of a graph, Graph Theory Newslett

B. D. Acharya
1988
View 1 Excerpt

Graphoidal covers and graphoidal covering number of a graph

B. D. Acharya, E. Sampathkumar
Indian J. Pure Appl. Math • 1987
View 1 Excerpt

Harary , Covering and packing in graphs I

F.
Ann . N . Y . Acad . Sci . • 1970

Graphs with unique minimum graphoidal cover

B. D. Acharya S. Arumugam, E. Sampathkumar, C. Pakkiam
Indian J . Pure Appl . Math .

Similar Papers

Loading similar papers…