WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
From MaRDI portal
Publication:2959614
DOI10.12732/ijam.v29i4.1zbMath1357.05116arXiv1604.06452OpenAlexW2963594876MaRDI QIDQ2959614
Publication date: 9 February 2017
Published in: International Journal of Apllied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06452
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (4)
The Hosoya polynomial of double weighted graphs ⋮ The \(k\)-power domination problem in weighted trees ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
This page was built for publication: WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS