Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on domination parameters in random graphs

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

DOI10.7151/dmgt.1409zbMath1156.05040OpenAlexW2165079333MaRDI QIDQ3606458

Anthony Bonato, Changping Wang

Publication date: 26 February 2009

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/259b90ba7cd12c0407289f533f938ee92f6c3f8b


zbMATH Keywords

random graphsdominationtotal dominationindependent domination


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items

Connected domination in random graphs ⋮ The 2-tuple dominating independent number of a random graph



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3606458&oldid=17025071"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 04:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki