cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota bandung,
Jawa barat
INDONESIA
Journal of the Indonesian Mathematical Society
Published by Indonesian Mathematical Society
ISSN : 20868952     EISSN : 24600245     DOI : -
Core Subject : Education,
Mathematics
Journal of the Indonesian Mathematical Society disseminates new research results in all areas of mathematics and their applications. Besides research articles, the journal also receives survey papers that stimulate research in mathematics and their applications.
Arjuna Subject : -
Articles 26 Documents
 1   2   3 
Search results for , issue "Special Edition, Year 2011" : 26 Documents clear
GRACEFUL LABELING ALGORITHMS AND COMPLEXITY – A SURVEY Arumugam, S.; Bagga, Jay
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.14.1-9

Abstract

Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful labeling. Aldred and McKay and others have used computer programs to show that trees of order up to 35 are graceful. Bagga et al. investigated algorithms for generating all graceful labelings of certain known classes of graceful graphs, including paths, cycles, and certain other classes of unicyclic graphs. The data generated by such algorithms has led to the discovery of new properties of such graceful labelings. In this paper we present a survey of graceful graph labeling algorithms and related complexity issues.DOI : http://dx.doi.org/10.22342/jims.0.0.14.1-9
DISTANCE MAGIC GRAPHS - A SURVEY Arumugam, S.; Froncek, Dalibor; Kamatchi, N.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.15.11-26

Abstract

Let iG = (V;E)/i be a graph of order n. A bijection if : V rarr; {1, 2,...,n} /iis called ia distance magic labeling /iof G if there exists a positive integer k such that iSigma; f(u) = k /i for all iv epsilon; V/i, where iN(v)/i is the open neighborhood of v. The constant k is called the magic constant of the labeling f. Any graph which admits ia distance magic labeling /iis called a distance magic graph. In this paper we present a survey of existing results on distance magic graphs along with our recent results,open problems and conjectures.DOI : http://dx.doi.org/10.22342/jims.0.0.15.11-26
DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES Froncek, Dalibor; Tollefson, Leah
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.17.39-44

Abstract

A canoe paddle is a cycle attached to an end-vertex of a path. It was shown by Truszczynski that all canoe paddles are graceful and therefore decompose complete graphs. A kayak paddle is a pair of cycles joined by a path. We prove that the complete graph Ksub2n+1/sub is decomposable into kayak paddles with in/i edges whenever at least one of its cycles is eve.DOI : http://dx.doi.org/10.22342/jims.0.0.17.39-44
LIVING WITH THE LABELING DISEASE FOR 25 YEARS Gallian, Joseph A.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.18.45-58

Abstract

In this article I trace my involvement with graph labeling for the past 25 years. I provide some statistical information about the growth in interest in graph labeling and some open problems that I believe are accessible.DOI : http://dx.doi.org/10.22342/jims.0.0.18.45-58
ON THE SUPER EDGE-MAGIC DEFICIENCY AND Α -VALUATIONS OF GRAPHS Ichishima, Rikio; Oshima, Akito
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.19.59-69

Abstract

Pdf Abstract.DOI : http://dx.doi.org/10.22342/jims.0.0.19.59-69
ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS Krop, Elliot; Lee, Sin-Min; Raridan, Christopher
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.20.71-78

Abstract

We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product Ksubn/sub X Ksub2/sub. We also prove a lemma that is helpful to determine theedge-balanced index sets of regular graphs.DOI : http://dx.doi.org/10.22342/jims.0.0.20.71-78
VERTEX (A,D)-ANTIMAGIC TOTAL LABELING ON CIRCULANT GRAPH CN(1,2,3) Sugeng, K. A.; Bong, N. H.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.21.79-88

Abstract

Pdf Abstract.DOI : http://dx.doi.org/10.22342/jims.0.0.21.79-88
AN INTRODUCTION TO DISTANCE D MAGIC GRAPHS O'Neal, Allen; Slater, Peter J.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.22.89-107

Abstract

Pdf Abstract.DOI : http://dx.doi.org/10.22342/jims.0.0.22.89-107 
DECOMPOSITION OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS INTO COPIES OF Pn3 or S2Pn3 AND HARMONIOUS LABELING OF K2+ Pn Selvaraju, P.; Sethuraman, G.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.23.109-122

Abstract

Pdf AbstractDOI : http://dx.doi.org/10.22342/jims.0.0.23.109-122
TOTALLY MAGIC INJECTIONS D. Wallis, W.
Journal of the Indonesian Mathematical Society Special Edition, Year 2011
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.0.0.24.123-131

Abstract

A labelling is a mapping whose domain is some set of graph elements- the set of vertices, for example, or the set of all vertices and edges - and whose range is a set of positive integers. In particular, if the labels associated with any edge - the label on the edge itself, and those on its endpoints -always add to the same sum, the labeling, and the graph possessing it, is called magic. A related concept, a vertex-magic total labeling, is one in which the sum of the label on any vertex with the labels on the edges containing it is always constant. A labeling which has both the vertex-magic and edge-magic properties (usually with two different constants) is called totally magic, as is a graph possessing such a labeling. In this paper we survey what is known about totally magic graphs and an important generalization.DOI : http://dx.doi.org/10.22342/jims.0.0.24.123-131

Page 1 of 3 | Total Record : 26

 1   2   3 

Filter by Year

2011 2011


Reset
Filter By Issues
All Issue Vol. 31 No. 3 (2025): SEPTEMBER Vol. 31 No. 2 (2025): JUNE Vol. 31 No. 1 (2025): MARCH Vol. 30 No. 3 (2024): NOVEMBER Vol. 30 No. 2 (2024): JULY VOLUME 30 NUMBER 1 (MARCH 2024) VOLUME 29 NUMBER 3 (NOVEMBER 2023) VOLUME 29 NUMBER 2 (JULY 2023) VOLUME 29 NUMBER 1 (MARCH 2023) VOLUME 28 NUMBER 3 (NOVEMBER 2022) VOLUME 28 NUMBER 2 (JULY 2022) VOLUME 28 NUMBER 1 (MARCH 2022) VOLUME 27 NUMBER 3 (November 2021) VOLUME 27 NUMBER 2 (July 2021) VOLUME 27 NUMBER 1 (MARCH 2021) VOLUME 26 NUMBER 3 (NOVEMBER 2020) Volume 26 Number 2 (July 2020) Volume 26 Number 1 (March 2020) Volume 25 Number 3 (November 2019) Volume 25 Number 2 (July 2019) Volume 25 Number 1 (March 2019) Volume 24 Number 2 (October 2018) Volume 24 Number 1 (April 2018) Volume 23 Number 2 (October 2017) Volume 23 Number 1 (April 2017) Volume 22 Number 2 (October 2016) Volume 22 Number 1 (April 2016) Volume 21 Number 2 (October 2015) Volume 21 Number 1 (April 2015) Volume 20 Number 2 (October 2014) Volume 20 Number 1 (April 2014) Volume 19 Number 2 (October 2013) Volume 19 Number 1 (April 2013) Volume 18 Number 2 (October 2012) Volume 18 Number 1 (April 2012) Volume 17 Number 2 (October 2011) Volume 17 Number 1 (April 2011) Special Edition, Year 2011 Volume 16 Number 2 (October 2010) Volume 16 Number 1 (April 2010) Volume 15 Number 2 (October 2009) Volume 15 Number 1 (April 2009) Volume 14 Number 2 (October 2008) Volume 14 Number 1 (April 2008) Volume 13 Number 2 (October 2007) Volume 13 Number 1 (April 2007) More Issue