Dominator sequences in bipartite graphs
From MaRDI portal
Publication:2404078
DOI10.1016/j.tcs.2017.06.022zbMath1373.05140MaRDI QIDQ2404078
S. Arumugam, Krishnaiyan Thulasiraman, Balasubramaniam Jayaram
Publication date: 12 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.022
bipartite graph; optical networks; domination number; dominator sequence number; survivability of IP-over-WDM networks
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Dominator sequences in bipartite graphs, Some results on Parikh word representable graphs and partitions
Cites Work