Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graphs with unique minimum graphoidal cover

From MaRDI portal
Publication:1346465
Jump to:navigation, search

zbMath0813.05040MaRDI QIDQ1346465

C. Pakkiam, S. Arumugam

Publication date: 4 April 1995

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

pathsgraphoidal covergraphoidal covering numberminimum graphoidal cover


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (6)

SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ Truly non-trivial graphoidal graphs ⋮ Monophonic graphoidal covering number of corona product graphs ⋮ Acyclic graphoidal covers and path partitions in a graph ⋮ Graphoidally independent infinite graphs







This page was built for publication: Graphs with unique minimum graphoidal cover

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1346465&oldid=13481901"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki