Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:3633752
Jump to:navigation, search

zbMATH Open1285.05097MaRDI QIDQ3633752FDOQ3633752

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




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)\).


zbMATH Keywords

Knödel graphminimum cardinality of a dominating set


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)



Cited In (7)

  • Title not available (Why is that?)
  • Domination in 4-regular Knödel graphs
  • Diameter of General Knödel Graphs
  • Upper bounds on the broadcast function using minimum dominating sets
  • Domination in Kn\"odel Graphs
  • Variants of the domination number for flower snarks
  • 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3633752&oldid=17074170"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 05:25. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki