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:3791165
Jump to:navigation, search

zbMath0647.05020MaRDI QIDQ3791165

Marilynn L. Livingston, Frank Harary

Publication date: 1986


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

zbMATH Keywords

treesindependent domination numberindependentindependent dominating set


Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)


Related Items (11)

Construction of Halin graph with perfect k-ary tree and its independent domination number ⋮ Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ On graphs with equal domination and independent domination numbers ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ On graphs with equal total domination and connected domination numbers ⋮ Graphs with equal domination and independent domination numbers ⋮ On weakly connected domination in graphs. II. ⋮ Unique irredundance, domination and independent domination in graphs ⋮ What is the difference between the domination and independent domination numbers of a cubic graph? ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3791165&oldid=17356326"
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 14:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki