On double domination numbers of signed complete graphs

DOI10.1142/S1793830924500940MaRDI QIDQ6900733zbMATH OpenFDO

Authors Deepak Sehrawat

Publication date 12 November 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500940

zbMATH Keywords

balancecomplete graphdouble domination numbersigned graphswitching isomorphism

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A new lower bound on the double domination number of a graph
• Domination and absorbance in signed graphs and digraphs. I: Foundations
• Double domination and super domination in trees
• Double domination in lexicographic product graphs
• Double domination in signed graphs
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• scientific article; zbMATH DE number 2188616 (Why is no real title available?)
• Independent and double domination in trees
• On Double Domination in Graphs
• On the notion of balance of a signed graph
• SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES
• Signed graphs
• The chromatic polynomials of signed Petersen graphs

This page was built for publication: On double domination numbers of signed complete graphs

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