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

Upper bounds for the \(k\)-subdomination number of graphs

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

DOI10.1016/S0012-365X(01)00311-9zbMath0990.05098MaRDI QIDQ1598803

Mao-cheng Cai, Li-ying Kang, Chuangyin Dang, Erfang Shan

Publication date: 28 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

dominating function\(k\)-subdomination


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (3)

Lower bounds on the minus domination and \(k\)-subdomination numbers. ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs




This page was built for publication: Upper bounds for the \(k\)-subdomination number of graphs

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