An algorithm to check the equality of total domination number and double of domination number in graphs (Q5099751): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a Class of Graphs with Large Total Domination Number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Total domination versus domination in cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2770439 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3004147 / rank | |||
Normal rank | |||
Latest revision as of 23:18, 29 July 2024
scientific article; zbMATH DE number 7576376
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to check the equality of total domination number and double of domination number in graphs |
scientific article; zbMATH DE number 7576376 |
Statements
An algorithm to check the equality of total domination number and double of domination number in graphs (English)
0 references
26 August 2022
0 references
domination number
0 references
total domination number
0 references
