On graphoidal length of a tree in terms of its diameter
From MaRDI portal
Publication:5012367
DOI10.1016/j.akcej.2019.12.012zbMath1468.05226OpenAlexW3047638266MaRDI QIDQ5012367
Purnima Gupta, Megha Agarwal, Rajesh Singh
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.012
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on graphoidal length of a graph
- Graphoidal covers and graphoidal covering number of a graph
- On the graphoidal covering number of a graph
- Domination in graphoidal covers of a graph
- Graphoidal bipartite graphs
- Acyclic graphoidal covers and path partitions in a graph
- Further results on domination in graphoidally covered graphs
- ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
- Graphs whose acyclic graphoidal covering number is one less than its maximum degree
This page was built for publication: On graphoidal length of a tree in terms of its diameter