Pelabelan 0-Anti Ajaib dan 2-Anti Ajaib untuk Graf Tangga L

Quinoza Guvil -, Roni Tri Putra


For a connected graph  and a subset  of   . For a vertex  the distance betwen  and  is . For an ordered k-partition of ,  the representation of   with respect to  is    The k-partition  is a resolving partition if  are distinct for every  The minimum k for which there is a resolving partition of   is the partition dimension of   In this paper will shown resolving partition of  connected graph order  where  is a bipartite graph. Then it is shown dimension partition of bipartite graph, are pd(Kst)=n-1


Connected Graph, Bipartite Graph, Resolving Partition and Dimension Partition

Full Text:



Baca, M dan Miller,M, 2008, Super Edge-Antimagic Graphs, Brown Walker Press,Boca Raton-Florida.

Bondy, J.A. dan Murty, U.S.R.. 1976. Graph Theory with Applications. The Macmillan Press LTD. London.

Hartsfield, N dan Ringel, G. 1990. Pearls in Graph Theory, Academic Press. Boston.

Ko- Wei Lih. 1983. On Magic and Consecutive Labeling Of Plane Graphs, Utilitas Math. 24 .165-197.

Oss, S.L., Differential Equations, edition, John Wiley & Sons, University of New Hampshire, 1984.

Verhultz, Ferdinand, 1990, Nonlinear Differential Equations and Dynamical Systems, Springer – Verlag, Berlin.

Wiggins S, 1990, Introduction to Applied Nonlinear Dynamical Systems and Chaos, Springer – Verlag, New York.

Wallis, W.D. 2001. Magic Graphs, Birkhauser, Berlin. Boston-Basel.

West, D.B. 1996. An Introduction to Graph Theory. Prentice – Hall.



  • There are currently no refbacks.