On the distance domination number of bipartite graphs (Q4958000): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2784326 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient dominating sets in Cayley graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance domination and distance irredundance in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total $k$-distance domination critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance paired domination numbers of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3614024 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination number of the non-commuting graph of finite groups / rank | |||
Normal rank |
Latest revision as of 13:05, 26 July 2024
scientific article; zbMATH DE number 7391451
Language | Label | Description | Also known as |
---|---|---|---|
English | On the distance domination number of bipartite graphs |
scientific article; zbMATH DE number 7391451 |
Statements
On the distance domination number of bipartite graphs (English)
0 references
6 September 2021
0 references
domination
0 references
\(k\)-distance domination
0 references
connected bipartite
0 references