Bounds on graphoidal length of a graph

DOI10.1016/J.ENDM.2016.05.010MaRDI QIDQ327633zbMATHOpenAlexFDO

Authors S. Arumugam, Purnima Gupta, Rajesh Singh

Publication date 19 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.05.010

zbMATH Keywords

graphoidal covergraphoidal covering numbergraphoidal length

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graphoidal length and graphoidal covering number of a graph
• On graphs whose graphoidal length is half of its size
• On graphoidal length of a tree in terms of its diameter
• Graphoidal covers and graphoidal covering number of a graph
• Simple graphoidal covers in a graph

Cites work

• Domination in graphoidal covers of a graph
• Further results on domination in graphoidally covered graphs
• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• Parallel concepts in graph theory

Cited in

(7)

• scientific article; zbMATH DE number 108143 (Why is no real title available?)
• The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
• On graphoidal length of a tree in terms of its diameter
• Further results on induced graphoidal decomposition
• On graphs whose graphoidal length is half of its size
• Graphoidal length and graphoidal covering number of a graph
• Graphoidally independent infinite graphs

This page was built for publication: Bounds on graphoidal length of a graph

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