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

scientific article

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

zbMath0977.05094MaRDI QIDQ2761000

S. Arumugam, S. Velammal

Publication date: 17 December 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cliquetotal domination numberedge domination number


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (5)

Equality in a bound that relates the size and the restrained domination number of a graph ⋮ An inequality that relates the size of a bipartite graph with its order and restrained domination number ⋮ Strong kernel number in certain oriented cycle extension of graphs ⋮ Connected Domination ⋮ Maximum sizes of graphs with given domination parameters




This page was built for publication:

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