Skip to main content
SpringerLink
Log in

Finding a minimal spanning hypertree of a weighted hypergraph

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A hypergraph has a complex structure, which is why some re- searchers seek to transform the hypergraph into a graph. In this paper, we present two corresponding graphs for each hypergraph and naming them in the Clique graph and the Persian graph. They have a simpler structure than the graph, and it is easier to work with these graphs. Using these graphs, we are looking for minimal spanning hypertree for the hypergraph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Bahmanian MA, Sajna M (2015) Connection and separation in hypergraphs. Theory Appl Graph 2(2):5

    MathSciNet  MATH  Google Scholar 

  • Bondy JA, Murty USR (1976) Graph theory with applications, vol 290, London, Macmillan

  • Conlon D, Fox J, Sudakov B (2010) Hypergraph ramsey numbers. J Am Math Soc 23(1):247–266

    Article  MathSciNet  Google Scholar 

  • Dewar M, Pike D, Proos J (2018) Connectivity in hypergraphs. Canadian Math Bull 61(2):252–271

    Article  MathSciNet  Google Scholar 

  • Füredi Z (1984) Hypergraphs in which all disjoint pairs have distinct unions. Combinatorica 4(2–3):161–168

    Article  MathSciNet  Google Scholar 

  • Gao J, Zhao Q, Ren W, Swami A, Ramanathan R, Bar-Noy A (2014) Dynamic shortest path algorithms for hypergraphs. IEEE/ACM Trans Networking 23(6):1805–1817

    Article  Google Scholar 

  • Graham RL, Rothschild BL, Spencer JH (1990) Ramsey theory, vol 20, Wiley

  • Keevash P (2011) Hypergraph Turan problems. Surv Comb 392:83–140

    MathSciNet  MATH  Google Scholar 

  • Kim J (2016) Regular subgraphs of uniform hypergraphs. J Comb Theory Ser B 119:214–236

    Article  MathSciNet  Google Scholar 

  • Kim J, Kostochka AV (2014) Maximum hypergraphs without regu- lar subgraphs. Discuss Math Graph Theory 34(1):151–166

    Article  MathSciNet  Google Scholar 

  • Kostochka AV, Rödl V (2006) On Ramsey numbers of uniform hy- pergraphs with given maximum degree. J Comb Theory Ser A 113(7):1555–1564

    Article  Google Scholar 

  • Mubayi D, Verstraëte J (2004) A hypergraph extension of the bipar- tite Turán problem. J Comb Theory Ser A 106(2):237–253

    Article  Google Scholar 

  • Mubayi D, Verstraëte J (2009) Two-regular subgraphs of hypergraphs. J Comb Theory Ser B 99(3):643–655

    Article  MathSciNet  Google Scholar 

  • Pikhurko O, Verstraëte J (2009) The maximum size of hypergraphs without generalized 4-cycles. J. Comb. Theory Ser. A 116(3):637–649

    Article  MathSciNet  Google Scholar 

  • Shirdel GH, Vaez-Zadeh B (2019) The weak hyperedge tenacity of the hypercycles. Appl Appl Math 14(2)

  • Voloshin VI (2009) Introduction to graph and hypergraph theory. Nova Science Publ

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Sciences, University of Qom, Qom, Iran

    G. H. Shirdel & B. Vaez-Zadeh

Authors
  1. G. H. Shirdel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Vaez-Zadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. H. Shirdel.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shirdel, G.H., Vaez-Zadeh, B. Finding a minimal spanning hypertree of a weighted hypergraph. J Comb Optim 44, 894–904 (2022). https://doi.org/10.1007/s10878-022-00864-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-022-00864-z

Keywords

Mathematics Subject Classification

Search

Navigation