Research Article

Algorithmic Approach to Star Partition of the Graph

by  Ishwar Baidari, H B Walikar, Shridevi Shinde
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Issue 1
Published: November 2012
Authors: Ishwar Baidari, H B Walikar, Shridevi Shinde
10.5120/9250-3416
PDF

Ishwar Baidari, H B Walikar, Shridevi Shinde . Algorithmic Approach to Star Partition of the Graph. International Journal of Computer Applications. 58, 1 (November 2012), 41-43. DOI=10.5120/9250-3416

                        @article{ 10.5120/9250-3416,
                        author  = { Ishwar Baidari,H B Walikar,Shridevi Shinde },
                        title   = { Algorithmic Approach to Star Partition of the Graph },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 58 },
                        number  = { 1 },
                        pages   = { 41-43 },
                        doi     = { 10.5120/9250-3416 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A Ishwar Baidari
                        %A H B Walikar
                        %A Shridevi Shinde
                        %T Algorithmic Approach to Star Partition of the Graph%T 
                        %J International Journal of Computer Applications
                        %V 58
                        %N 1
                        %P 41-43
                        %R 10.5120/9250-3416
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

The purpose of this paper is to design an algorithm for star partitions of the graph. We shall now bring out a useful connection between the domination number of a graph and what we shall choose to call the 'star partition number' of the graph which is an invariant of the graph defined by a certain type of partition of its vertex set. We consider finite undirected graphs without loops or multiple edges

References
  • H B Walikar, "Some Topics in Graph Theory (Contribution to the Theory of Domination in Graphs and its Applications", 1980.
  • E Sampathkumar and H B Walikar "The Connected Domination Number of Graph", Jl. Maths. Phy. Sci. 13(6):1979,607-613.
  • C Berge, The Theory of Graph and its Applications. Metuen, London, 1962.
  • E. J Cockayne, and S. T. Hedetniemi, Towards a theory of domination in graphs. Networks, 7 (1977), 247- 261.
  • . Teresa W. Haynes, Stephen T. Hedetniemi and Peter J. Slater "Fundamentals of Domination in Graphs". Pure and Applied Mathematics. Marcel and Dekker 1998.
  • . Douglas B. West "Introduction to Graph Theory" PHI, 2nd edition 2001.
  • Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest "Introduction to Algorithms", PHI, Fourth Printing 2001.
  • . Gary Chartrand and Ortrud. R Oellermann "Applied and Algorithmic Graph Theory", McGraw-Hill, International edition 1993.
  • J A Bondy and U S R Murthy "Graph Theory", Springer2008.
  • D E Knuth "Fundamental Algorithm Volume -1"Addision Wesely Publishing Company,Second printing 1969.
  • E. J Cockayne, S E Goodman, and S. T. Hedetniemi, "A Linear Algorithm for the Domination Number of Tree", Inform. Process. Lett. ,4:41-44,1975.
  • S L Mitchell, E. J. Cockayne, And S T Hedetniemi. "Linear Algorithms on Recursive Representations of trees", J. Comput. System Sci. ,18(1):76-85,1979.
  • F Harary, Graph Theory, Addison – Wesley, Reading, Mass, 1969.
  • F. Harary, R. W. Robinson and N. C. Wormald, Isomorphic factorization – I: Complete Graphs. Trans. Amer. Math. Soc. , 242, 1978, 243-260.
  • O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Pub. , Providence, RI 38,1962.
  • Cockayne, E. J. and S. T. Hedetniemi, A linear algorithm for the maximum weight of an independent set in a tree. In Proc. Seventh S. E Conf. on Combinatorics, Graph. Theory and Computing, pages217-228. Utilities Math. , Winnipeg, 1976.
  • . Cockayne, E. J. and S. T. Hedetniemi, Towards a Theory Domination in graphs. Networks, 1977
  • E. J Cockayne, . and S. T. Hedetniemi, Towards a theory of domination in graphs.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

star partition domination number multiple edges

Powered by PhDFocusTM