Vector representation of graph domination

DOI10.1002/JGT.20606MaRDI QIDQ2888886zbMATH OpenOpenAlexFDO

Authors 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

graph dominationhomological connectivitymatching in hypergraphsvector representation

Mathematics Subject Classification ID

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

Recommendations

• On the computational complexity of upper fractional domination
• Domination numbers and homology
• On Domination in Graphs
• scientific article; zbMATH DE number 975353
• Approximations of the domination number of a graph

Cites work

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

Cited in

(2)

• A note on vector representation of graphs
• Multipartite hypergraphs achieving equality in Ryser's conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888886)