On the signed total domination number of generalized Petersen graphs P(n,2)

DOI10.4134/BKMS.2013.50.6.2021zbMATH Open1278.05144MaRDI QIDQ2872191FDOQ2872191

Authors: Wen-sheng Li, Moo Young Sohn, Hua-Ming Xing 

Publication date: 14 January 2014

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://mathnet.or.kr/mathnet/kms_content.php?no=411296

Recommendations

• The signed total domination number of graphs.
• scientific article; zbMATH DE number 2095760
• 2-signed total domination number of two classes of graphs
• Signed Total Domination Nnumber of a Graph
• On the total signed domination number of \(P_m\square C_n\).

zbMATH Keywords

generalized Petersen graphsigned total domination

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (5)

• The signed total reinforcement number of \(P (n, 2)\)
• Strong edge chromatic index of the generalized Petersen graphs
• SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
• Title not available (Why is that?)
• \([1,2]\)-domination in generalized Petersen graphs

This page was built for publication: On the signed total domination number of generalized Petersen graphs \(P(n,2)\)

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