Total outer-connected dominating sets and total outer-connected domination polynomial of complete bipartite graph K₂,n

DOI10.22098/JHS.2025.16719.1073MaRDI QIDQ7305663zbMATH OpenFDO

Authors V. Gracelin Goldy J., Lal Gipson K.

Publication date 30 July 2026

Published in Journal of Hyperstructures (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.22098/JHS.2025.16719.1073

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Special sequences and polynomials (11B83)

Cites work

• A note on the total outer-connected domination number of a tree
• Complexity of total outer-connected domination problem in graphs
• Dominating sets and domination polynomials of paths
• Generalization of the total outer-connected domination in graphs
• Handbook of Graph Theory
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the roots of total domination polynomial of graphs
• On the total outer-connected domination in graphs
• The co-connected domination polynomial of a graph
• The outer-connected domination number of a graph
• Total outer connected vertex-edge domination
• Total outer-connected domination in trees
• Total outer-connected domination numbers of trees

This page was built for publication: Total outer-connected dominating sets and total outer-connected domination polynomial of complete bipartite graph \(K_{2,n}\)

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