Relating hypergraph parameters of generalized power graphs

DOI10.1007/978-3-030-63072-0_10zbMath1479.05243OpenAlexW3135347585MaRDI QIDQ2056895

Lucas L. S. Portugal, Simone Dantas, Renata R. Del-Vecchio

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_10

zbMATH Keywords

spectral parametersstrong chromatic numberadjacency matrix of hypergraphgeneralized power graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On vertex independence number of uniform hypergraphs
• Spectra of uniform hypergraphs
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• Equitable partition theorem of tensors and spectrum of generalized power hypergraphs
• Spectra of hypergraphs and applications
• Hypergraph theory. An introduction
• Spectral radii of two kinds of uniform hypergraphs
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Finding perfect matchings in bipartite hypergraphs
• Connectivity in Hypergraphs
• Approximation and Online Algorithms

This page was built for publication: Relating hypergraph parameters of generalized power graphs