Total Minimal Dominating Signed Graph

International J.Math. Combin. Vol.3 (2010), 11-16 Total Minimal Dominating Signed Graph P.Siva Kota Reddy (Department of Mathematics, Acharya Institute of Technology, Bangalore-560 090, India) S. Vijay (Department of Mathematics, Govt. First Grade College, Kadur, Chikkamangalore 577 548, India) Email: pskreddy@acharya.ac.in Abstract: A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ) (S = (G, µ)) where G = (V, E) is a graph called underlying graph of S and σ : E (e 1, e 2,..., e k ) (µ : V (e 1, e 2,..., e k )) is a function, where each e i {+, }. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. In this paper, we define the total minimal dominating signed graph M t(s) = (M t(g), σ) of a given signed digraph S = (G, σ) and offer a structural characterization of total minimal dominating signed graphs. Further, we characterize signed graphs S for which S M t(s) and L(S) M t(s), where denotes switching equivalence and M t(s) and L(S) are denotes total minimal dominating signed graph and line signed graph of S respectively. Key Words: Smarandachely k-signed graphs, Smarandachely k-marked graphs, signed graphs, marked graphs, balance, switching, total minimal dominating signed graph, line signed graphs, negation. AMS(2000): 05C22 1. Introduction Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8]. We consider only finite, simple graphs free from self-loops. A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ) (S = (G, µ)) where G = (V, E) is a graph called underlying graph of S and σ : E (e 1, e 2,..., e k ) (µ : V (e 1, e 2,..., e k )) is a function, where each e i {+, }. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Cartwright and Harary [5] considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the 1 Received July 20, 2010. Accepted September 3, 2010.

12 P.Siva Kota Reddy and S. Vijay relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph (Chartrand [6]; Harary et al. [11]). Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process (e.g., see Katai and Iwai [13], Roberts [15] and Roberts and Xu [16]) and also because of their interesting connections with many classical mathematical systems (Zaslavsky [22]). A cycle in a signed graph S is said to be positive if the product of signs of its edges is positive. A cycle which is not positive is said to be negative. A signed graph is then said to be balanced if every cycle in it is positive (Harary [9]). Harary and Kabell [22] developed a simple algorithm to detect balance in signed graphs as also enumerated them. A marking of S is a function µ : V (G) {+, }; A signed graph S together with a marking µ is denoted by S µ. Given a signed graph S one can easily define a marking µ of S as follows: For any vertex v V (S), µ(v) = uv E(S) the marking µ of S is called canonical marking of S. σ(uv), The following characterization of balanced signed graphs is well known. Theorem 1(E. Sampathkumar [17]) A signed graph S = (G, σ) is balanced if, and only if, there exists a marking µ of its vertices such that each edge uv in S satisfies σ(uv) = µ(u)µ(v). The idea of switching a signed graph was introduced by Abelson and Rosenberg [1] in connection with structural analysis of marking µ of a signed graph S. Switching S with respect to a marking µ is the operation of changing the sign of every edge of S to its opposite whenever its end vertices are of opposite signs. The signed graph obtained in this way is denoted by S µ (S) and is called µ-switched signed graph or just switched signed graph. Two signed graphs S 1 = (G, σ) and S 2 = (G, σ ) are said to be isomorphic, written as S 1 = S2 if there exists a graph isomorphism f : G G (that is a bijection f : V (G) V (G ) such that if uv is an edge in G then f(u)f(v) is an edge in G ) such that for any edge e G, σ(e) = σ (f(e)). Further a signed graph S 1 = (G, σ) switches to a signed graph S 2 = (G, σ ) (or that S 1 and S 2 are switching equivalent) written S 1 S 2, whenever there exists a marking µ of S 1 such that S µ (S 1 ) = S 2. Note that S 1 S 2 implies that G = G, since the definition of switching does not involve change of adjacencies in the underlying graphs of the respective signed graphs. Two signed graphs S 1 = (G, σ) and S 2 = (G, σ ) are said to be weakly isomorphic (see [20]) or cycle isomorphic (see [21]) if there exists an isomorphism φ : G G such that the sign of every cycle Z in S 1 equals to the sign of φ(z) in S 2. The following result is well known (See [21]): Theorem(T. Zaslavsky [21]) Two signed graphs S 1 and S 2 with the same underlying graph are switching equivalent if, and only if, they are cycle isomorphic.

Total Minimal Dominating Signed Graph 13 2. Total Minimal Dominating Signed Graph The total minimal dominating graph M t (G) of a graph G is the intersection graph on the family of all total minimal dominating sets of vertices in G. This concept was introduced by Kulli and Iyer [14]. We now extend the notion of M t (G) to the realm of signed graphs. The total minimal dominating signed graph M t (S) of a signed graph S = (G, σ) is a signed graph whose underlying graph is M t (G) and sign of any edge uv is M t (S) is µ(u)µ(v), where µ is the canonical marking of S. Further, a signed graph S = (G, σ) is called total minimal dominating signed graph, if S = M t (S ) for some signed graph S. The following result restricts the class of total minimal dominating signed graphs. Theorem 3 For any signed graph S = (G, σ), its total minimal dominating signed graph M t (S) is balanced. Proof Since sign of any edge uv is M t (S) is µ(u)µ(v), where µ is the canonical marking of S, by Theorem 1, M t (S) is balanced. For any positive integer k, the k th iterated total minimal dominating signed graph, M k t (S) of S is defined as follows: Mt 0(S) = S, Mk t (S) = M t(mt k 1 (S)) Corollary 4 For any signed graph S = (G, σ) and for any positive integer k, M k t (S) is balanced. The following result characterizes signed graphs which are total minimal dominating signed graphs. Theorem 5 A signed graph S = (G, σ) is a total minimal dominating signed graph if, and only if, S is balanced signed graph and its underlying digraph G is a total minimal dominating graph. Proof Suppose that S is total minimal dominating signed graph. Then there exists a signed graph S = (G, σ ) such that M t (S ) = S. Hence by definition M t (G) = G and by Theorem 3, S is balanced. Conversely, suppose that S = (G, σ) is balanced and G is total minimal dominating graph. That is there exists a graph G such that M t (G ) = G. Since S is balanced by Theorem 1, there exists a marking µ of vertices of S such that for any edge uv G, σ(uv) = µ(u)µ(v). Also since G = M t (G ), vertices in G are in one-to-one correspondence with the edges of G. Now consider the signed graph S = (G, σ ), where for any edge e in G to be the marking on the corresponding vertex in G. Then clearly M t (S ) = S and so S is total minimal dominating graph. In [3], the authors proved the following for a graph G its total minimal dominating graph M t (G) is isomorphic to G then G is either C 3 or C 4. Analogously we have the following. Theorem 6 For any signed graph S = (G, σ), S M t (S) if, and only if, G is isomorphic to either C 3 or C 4 and S is balanced.

14 P.Siva Kota Reddy and S. Vijay Proof Suppose S M t (S). This implies, G = M t (G) and hence by the above observation we see that the graph G must be isomorphic to either C 3 or C 4. Now, if S is any signed graph on any one of these graphs, Theorem 3 implies that M t (S) is balanced and hence if S is unbalanced its M t (S) being balanced cannot be switching equivalent to S in accordance with Theorem 2. Therefore, S must be balanced. Conversely, suppose that S is balanced signed graph on C 3 or C 4. Then, since M t (S) is balanced as per Theorem 3, the result follows from Theorem 2 again. Behzad and Chartrand [4] introduced the notion of line signed graph L(S) of a given signed graph S as follows: Given a signed graph S = (G, σ) its line signed graph L(S) = (L(G), σ ) is the signed graph whose underlying graph is L(G), the line graph of G, where for any edge e i e j in L(S), σ (e i e j ) is negative if, and only if, both e i and e j are adjacent negative edges in S. Another notion of line signed graph introduced in [7], is as follows: The line signed graph of a signed graph S = (G, σ) is a signed graph L(S) = (L(G), σ ), where for any edge ee in L(S), σ (ee ) = σ(e)σ(e ). In this paper, we follow the notion of line signed graph defined by M. K. Gill [7] (See also E. Sampathkumar et al. [18,19]). Theorem 7(M. Acharya [2]) For any signed graph S = (G, σ), its line signed graph L(S) = (L(G), σ ) is balanced. We now characterize signed graphs whose total minimal dominating signed graphs and its line signed graphs are switching equivalent. In the case of graphs the following result is due to Kulli and Iyer [14]. Theorem 8(Kulli and Iyer [14]) If G is a (p 2)-regular graph then, M t (G) = L(G). Theorem 9 For any signed graph S = (G, σ), M t (S) L(S), if, and only if, G is (p 2)- regular. Proof Suppose M t (S) L(S). This implies, M t (G) = L(G) and hence by Theorem 8, we see that the graph G must be (p 2)-regular. Conversely, suppose that G is (p 2)-regular. Then M t (G) = L(G) by Theorem 8. Now if S is signed graph with (p 2)-regular, then by Theorem 3 and Theorem 7, M t (S) and L(S) are balanced and hence, the result follows from Theorem 2. The notion of negation η(s) of a given signed graph S defined in [10] as follows: η(s) has the same underlying graph as that of S with the sign of each edge opposite to that given to it in S. However, this definition does not say anything about what to do with nonadjacent pairs of vertices in S while applying the unary operator η(.) of taking the negation of S. Theorem 6 provides easy solutions to two other signed graph switching equivalence relations, which are given in the following results. Corollary 10 For any signed graph S = (G, σ), M t (η(s)) M t (S).

Total Minimal Dominating Signed Graph 15 Corollary 11 For any signed graph S = (G, σ), η(s) M t (S) if, and only if, S is an unbalanced signed graph and G = C 3. For a signed graph S = (G, σ), the M t (S) is balanced (Theorem 3). We now examine, the conditions under which negation η(s) of M t (S) is balanced. Corollary 12 Let S = (G, σ) be a signed graph. If M t (G) is bipartite then η(m t (S)) is balanced. Proof Since, by Theorem 3 M t (S) is balanced, if each cycle C in M t (S) contains even number of negative edges. Also, since M t (G) is bipartite, all cycles have even length; thus, the number of positive edges on any cycle C in M t (S) is also even. Hence η(m t (S)) is balanced. Acknowledgement The first author very much thankful to Sri. B. Premnath Reddy, Chairman, Acharya Institutes, for his constant support and encouragement for R & D. References [1] R. P. Abelson and M. J. Rosenberg, Symoblic psychologic:a model of attitudinal cognition, Behav. Sci., 3 (1958), 1-13. [2] M. Acharya, x-line sigraph of a sigraph, J. Combin. Math. Combin. Comput., 69(2009), 103-111. [3] B. Basvanagoud and S. M. Hosamani, Miscellaneous properties of the total minimal dominating graph, Journal of Analysis and Computation, to appear. [4] M. Behzad and G. T. Chartrand, Line-coloring of signed graphs, Elemente der Mathematik, 24(3) (1969), 49-52. [5] D.W. Cartwright and F. Harary, Structural balance: A generalization of Heider s Theory, Psych. Rev., 63(1956), 277-293. [6] G.T. Chartrand, Graphs as Mathematical Models, Prindle, Weber & Schmidt, Inc., Boston, Massachusetts 1977. [7] M. K. Gill, Contributions to some topics in graph theory and its applications, Ph.D. thesis, The Indian Institute of Technology, Bombay, 1983. [8] F. Harary, Graph Theory, Addison-Wesley Publishing Co., 1969. [9] F. Harary, On the notion of balance of a signed graph, Michigan Math. J., 2(1953), 143-146. [10] F. Harary, Structural duality, Behav. Sci., 2(4) (1957), 255-265. [11] F. Harary, R.Z. Norman and D.W. Cartwright, Structural models: An introduction to the theory of directed graphs, Wiley Inter-Science, Inc., New York, 1965. [12] F. Harary and J.A. Kabell, Counting balanced signed graphs using marked graphs, Proc. Edinburgh Math. Soc., 24 (2)(1981), 99-104. [13] O. Katai and S. Iwai, Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures, J. Math.

16 P.Siva Kota Reddy and S. Vijay Psychol., 18(1978), 140-176. [14] V. R. Kulli and R. R. Iyer, The total minimal dominating graph of a graph-preprint. [15] F.S. Roberts, Graph Theory and its Applications to Problems of Society, SIAM, Philadelphia, PA, USA, 1978. [16] F.S. Roberts and Shaoji Xu, Characterizations of consistent marked graphs, Discrete Applied Mathematics, 127(2003), 357-371. [17] E. Sampathkumar, Point signed and line signed graphs, Nat. Acad. Sci. Letters, 7(3) (1984), 91-93. [18] E. Sampathkumar, P. Siva Kota Reddy, and M. S. Subramanya, The Line n-sigraph of a symmetric n-sigraph, Southeast Asain Bull. Math., 34(4) (2010), to appear. [19] E. Sampathkumar, M. S. Subramanya and P. Siva Kota Reddy, Characterization of Line Sidigraphs, Southeast Asian Bull. Math., to appear. [20] T. Sozánsky, Enueration of weak isomorphism classes of signed graphs, J. Graph Theory, 4(2)(1980), 127-144. [21] T. Zaslavsky, Signed Graphs, Discrete Appl. Math., 4(1)(1982), 47-74. [22] T. Zaslavsky, A mathematical bibliography of signed and gain graphs and its allied areas, Electronic J. Combin., 8(1)(1998), Dynamic Surveys (1999), No. DS8.