On the trees with maximum cardinality-redundance number

DOI10.56415/CSJM.V32.03MaRDI QIDQ6546352FDO

Authors Elham Mohammadi, Nader Jafari Rad

Publication date 29 May 2024

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

treesdominating setcardinality-redundance

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Extremal problems related to the cardinality-redundance of graphs
• scientific article; zbMATH DE number 5036081
• Irredundance, secure domination and maximum degree in trees
• Irredundance and Maximum Degree in Graphs
• Dominating sets and independent sets in a tree.

Cites work

• scientific article; zbMATH DE number 4150229 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Extremal problems related to the cardinality-redundance of graphs
• Lower bound on the domination number of a tree
• Lower bounds for the domination number

Cited in

(1)

• Extremal problems related to the cardinality-redundance of graphs

This page was built for publication: On the trees with maximum cardinality-redundance number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546352)