On the 2-independence subdivision number of graphs

DOI10.22049/CCO.2021.27060.1186MaRDI QIDQ6158957zbMATH OpenOpenAlexFDO

Authors Nacéra Meddah, Mostafa Blidia, Mustapha Chellali

Publication date 1 June 2023

Full work available at URL http://comb-opt.azaruniv.ac.ir/article_14224_e81b235babb9101de9451e1938646d95.pdf

zbMATH Keywords

trees2-independencesubdivision numbers

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• 2-independent domination in trees
• Domination and independence subdivision numbers of graphs
• Trees whose 2-domination subdivision number is 2
• Independent domination subdivision in graphs
• 2-domination subdivision number of graphs

Cites work

• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 1934399 (Why is no real title available?)
• 2-domination subdivision number of graphs
• Domination and independence subdivision numbers of graphs
• Ratios of some domination parameters in trees
• Roman domination subdivision number of graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(2)

• Triple Roman domination subdivision number in graphs
• Open packing subdivision number of graphs

This page was built for publication: On the 2-independence subdivision number of graphs

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