On Domination and Independence Numbers of Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1990 English Publisher:Springer Science and Business Media LLCJournal:Results in Mathematics, volume 17, pages 333-341 (issn: 0378-6218, eissn: 1420-9012,

Copyright policy )

Authors: Topp, Jerzy; Volkmann, Lutz;

doi: 10.1007/bf03322468

On Domination and Independence Numbers of Graphs

- Summary
- Subjects
- Metrics

Abstract

The authors characterize those graphs which (1) have equal domination and independence numbers, and (2) are either bipartite or are block graphs, i.e., graphs in which every block is a complete graph.

Related Organizations

RWTH Aachen University
Germany

Keywords

Extremal problems in graph theory, domination number, Structural characterization of families of graphs, independence number, block graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average