On the domination number of Knödel graph W₃,n

MaRDI QIDQ3633752zbMATH OpenFDO

Authors Xueliang Fu, Xirong Xu, Yuansheng Yang, X. Feng

Publication date 23 June 2009

Full work available at URL http://www.ijpam.eu/contents/2009-50-4/9/9.pdf

zbMATH Keywords

Knödel graphminimum cardinality of a dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Total domination in cubic Knodel graphs
• Domination in Kn\"odel Graphs
• Domination in 4-regular Knödel graphs
• The exact domination number of generalized Petersen graphs P(n,k) with n=3k
• On the domination number of generalized Petersen graphs P(n,3).

Cited in

(9)

• scientific article; zbMATH DE number 1998292 (Why is no real title available?)
• Domination in 4-regular Knödel graphs
• Upper bounds on the broadcast function using minimum dominating sets
• Power domination in Knödel graphs and Hanoi graphs
• Diameter of General Knödel Graphs
• Domination in Kn\"odel Graphs
• Variants of the domination number for flower snarks
• Computation of captive, half certified and majority domination numbers of a family of 3-regular graphs
• Total domination in cubic Knodel graphs

This page was built for publication: On the domination number of Knödel graph \(W_{3,n}\)

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