On the characterization of maximal planar graphs with a given signed cycle domination number
From MaRDI portal
Publication:1637078
DOI10.1007/S10114-017-6283-3zbMath1388.05141OpenAlexW2767099681MaRDI QIDQ1637078
Publication date: 7 June 2018
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-6283-3
planar graphdomination numbermaximal planar graphsigned cycle domination numbersigned cycle domination function
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- On signed cycle domination in graphs
- On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4
- Three conjectures on the signed cycle domination in graphs
- On the Characterization of Graphs With Given Signed Cycle Domination Number
- On signed edge domination numbers of graphs
This page was built for publication: On the characterization of maximal planar graphs with a given signed cycle domination number