Vector representation of graph domination

DOI10.1002/jgt.20606zbMath1242.05216OpenAlexW1544450224MaRDI QIDQ2888886

Noga Zewi

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20606

zbMATH Keywords

vector representationgraph dominationhomological connectivitymatching in hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Multipartite hypergraphs achieving equality in Ryser's conjecture

Cites Work

• Ryser's conjecture for tripartite 3-graphs
• The clique complex and hypergraph matching
• Maximum degree and fractional matchings in uniform hypergraphs
• Relations between packing and covering numbers of a tree
• Domination numbers and homology
• Eigenvalues and homology of flag complexes and vector representations of graphs
• Expander graphs and their applications
• On the Shannon capacity of a graph
• Hall's theorem for hypergraphs

This page was built for publication: Vector representation of graph domination