Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

On the Signed Mobius Graph for ‘0’


Affiliations
1 Department of Mathematics, S. V. University, Tirupati – 517502, Andhra Pradesh, India
     

   Subscribe/Renew Journal


The signed graphs are rapidly developed in the recent years. A Sign graph is a graph in which each edge is assigned with either positive (+) sign or negative (-) sign. In this paper, we define the Signed Mobius graph for „0‟ by giving the signs to the edges of the graph of Mobius function for „0‟ by using the Mobius function value of the vertex. Here we study some properties of a sign graph to this Signed Mobius graph for „0‟ and we calculate the chromatic number of the Signed Mobius Graph for „0‟.

Keywords

Mobius Function, Graph of Mobius Function, Sign Function, Signed Mobius Graph, Balanced, Chromatic Number.
Subscription Login to verify subscription
User
Notifications
Font Size


  • Acharya B. D., Acharya M., Dot – Line Signed Graphs, Annalas of Pure and Applied Mathematics, Vol. 10, No. 1, 2015, pp. 21 – 27.
  • Csilla Bujtas, Sampathkumar E., Zsolt Tuza, Subramaya M. S., Charles Dominic, 3 – Consecutive C – Coloring of graphs, Discussiones Mathematicae Gaph theory, 30, 2010, 393 – 405.
  • Fritz Heider, Attitudes and cognitive organization. J. Psychology 21 (1946), 107-112.
  • Harary F., On the notion of balance of a signed graph, Michigan Math. J., 2(1953- 54), 143-146 and addendum preceding p.1.
  • Sampathkumar E., Sriraj M. A., Vertex labeled/colored Graphs, Matrices and Signed Graphs, Journal of Combinatorics, Information and System Sciences, Vol. 38, 2013, No. 1 – 4, pp 113 – 120.
  • Sampathkumar E., Subramanya M. S., Charles Dominic, 3 – consecutive vertex coloring of a graph, proc. ICDM 2008, RMS Lecture notes series No. 13, 2010, pp161 – 170.
  • Srimitra K. K., Shaik Sajana, Bharathi D., “Adjacency and Degree of Graph of Mobius Function”, i – manager‟s Journal on Mathematics, Vol. 5, No. 1, January – March 2016.
  • Thomas Zaslavsky. Signed Graph Coloring. (1981).
  • Zaslavsky T., A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas, VII Edition, Electronic J. Combinatorics, 8(1)(1998), Dynamic Surveys #8, pp.124.

Abstract Views: 491

PDF Views: 0




  • On the Signed Mobius Graph for ‘0’

Abstract Views: 491  |  PDF Views: 0

Authors

K. K. Srimitra
Department of Mathematics, S. V. University, Tirupati – 517502, Andhra Pradesh, India
D. Bharathi
Department of Mathematics, S. V. University, Tirupati – 517502, Andhra Pradesh, India
Shaik Sajana
Department of Mathematics, S. V. University, Tirupati – 517502, Andhra Pradesh, India

Abstract


The signed graphs are rapidly developed in the recent years. A Sign graph is a graph in which each edge is assigned with either positive (+) sign or negative (-) sign. In this paper, we define the Signed Mobius graph for „0‟ by giving the signs to the edges of the graph of Mobius function for „0‟ by using the Mobius function value of the vertex. Here we study some properties of a sign graph to this Signed Mobius graph for „0‟ and we calculate the chromatic number of the Signed Mobius Graph for „0‟.

Keywords


Mobius Function, Graph of Mobius Function, Sign Function, Signed Mobius Graph, Balanced, Chromatic Number.

References