Bounds on graphoidal length of a graph

DOI10.1016/J.ENDM.2016.05.010zbMATH Open1347.05048OpenAlexW2515439052MaRDI QIDQ327633FDOQ327633

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

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

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)

Cites Work

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

Cited In (7)

• The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
• Further results on induced graphoidal decomposition
• Title not available (Why is that?)
• Graphoidal length and graphoidal covering number of a graph
• Graphoidally independent infinite graphs
• On graphoidal length of a tree in terms of its diameter
• On graphs whose graphoidal length is half of its size

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)