WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS

From MaRDI portal
Publication:2959614

DOI10.12732/IJAM.V29I4.1zbMATH Open1357.05116arXiv1604.06452OpenAlexW2963594876MaRDI QIDQ2959614FDOQ2959614


Authors: Tina Novak, Janez Žerovnik Edit this on Wikidata


Publication date: 9 February 2017

Published in: International Journal of Apllied Mathematics (Search for Journal in Brave)

Abstract: In the paper, we write a linear algorithm for calculating the weighted domination number of a vertex-weighted cactus. The algorithm is based on the well known depth first search (DFS) structure. Our algorithm needs less than 12n+5b additions and 9n+2b min-operations where n is the number of vertices and b is the number of blocks in the cactus.


Full work available at URL: https://arxiv.org/abs/1604.06452




Recommendations





Cited In (8)





This page was built for publication: WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS

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