A NOT ON DOMINATING SET WITH MAPLE

DOI10.22436/JNSA.001.01.02MaRDI QIDQ3623269zbMATH OpenOpenAlexWikidataFDO

Authors Somayeh Mirzamani, M. Matinfar

Publication date 17 April 2009

Published in The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117315, http://www.emis.de/journals/TJNSA/no1.htm

zbMATH Keywords

adjacency matrixMAPLEMDSminimum dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On domination in connected cubic graphs
• On domination in 2-connected cubic graphs
• An upper bound on the domination number of \(n\)-vertex connected cubic graphs
• The domination number of cubic Hamiltonian graphs
• Domination versus edge domination

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A NOT ON DOMINATING SET WITH MAPLE

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