Finding the shortest path for a Hypergraph

DOI10.1142/S1793830921501202zbMath1493.05090OpenAlexW3185516383MaRDI QIDQ5866018

Gholam Hasan Shirdel, B. Vaez-Zadeh

Publication date: 10 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501202

zbMATH Keywords

Clique graphDijkestra algorithmPersian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular subgraphs of uniform hypergraphs
• Hypergraphs in which all disjoint pairs have distinct unions
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• The maximum size of hypergraphs without generalized 4-cycles
• Two-regular subgraphs of hypergraphs
• A hypergraph extension of the bipartite Turán problem
• Maximum hypergraphs without regular subgraphs
• Connectivity in Hypergraphs
• Connection and separation in hypergraphs

This page was built for publication: Finding the shortest path for a Hypergraph