On graphoidal graphs

DOI10.1080/09720529.2000.10697902MaRDI QIDQ4549935zbMATH OpenOpenAlexFDO

Authors S. Arumugam, J. Suresh Suseela

Publication date 7 January 2003

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2000.10697902

zbMATH Keywords

graphoidal coverpath

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• The graphoidal covering number of unicyclic graphs
• Graphs with unique minimum graphoidal cover
• Graphoidal covers and graphoidal covering number of a graph
• On graphoidal graphs of a tree
• scientific article; zbMATH DE number 2075117

Cites work

• Acyclic graphoidal covers and path partitions in a graph
• Graphoidal bipartite graphs

Cited in

(17)

• Bigeodetic graphs
• The graphoidal covering number of unicyclic graphs
• Graphoidal bipartite graphs
• Graphs with unique minimum graphoidal cover
• On graphoidal graphs of a tree
• On self-graphoidal graphs
• scientific article; zbMATH DE number 4130403 (Why is no real title available?)
• On graphs whose graphoidal domination number is one
• scientific article; zbMATH DE number 4160790 (Why is no real title available?)
• scientific article; zbMATH DE number 2075117 (Why is no real title available?)
• scientific article; zbMATH DE number 1512622 (Why is no real title available?)
• On varieties of orgraphs
• Truly nontrivial graphoidal covers. I
• Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
• Truly non-trivial graphoidal graphs
• On the plurality of graphs
• On a graph isomorphic to its intersection graph: self-graphoidal graphs

This page was built for publication: On graphoidal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549935)