Abstract
Let D = (V;A) be a finite simple directed graph (digraph). A function f : V ? {-1,1} is called a twin signed k-dominating function (TSkDF) if f (N-[v]) ? k and f (N+[v]) ? k for each vertex v ? V. The twin signed k-domination number of D is ?* sk(D) = min{?(f)?f is a TSkDF of D}. In this paper, we initiate the study of twin signed k-domination in digraphs and present some bounds on ?* sk(D) in terms of the order, size and maximum and minimum indegrees and outdegrees, generalising some of the existing bounds for the twin signed domination numbers in digraphs and the signed k-domination numbers in graphs. In addition, we determine the twin signed k-domination numbers of some classes of digraphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
