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 625 Documents
 26   27   28   29   30 
ON THE SUPER EDGE-MAGIC DEFICIENCY AND Α -VALUATIONS OF GRAPHS Rikio Ichishima; Akito Oshima
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 Elliot Krop; Sin-Min Lee; Christopher Raridan
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 K<sub>n</sub> X K<sub>2</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) K. A. Sugeng; N. H. Bong
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 Allen O'Neal; Peter J. Slater
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 P. Selvaraju; G. Sethuraman
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 W. D. Wallis
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
HOW PROVABLY GRACEFUL ARE THE TREES? Peter J. Slater
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.25.133-136

Abstract

Given the inability to prove that all trees are graceful, can we at least say something positive about their gracefulness? Two problems of this type are presented.DOI : http://dx.doi.org/10.22342/jims.0.0.25.133-136
SUPER EAT LABELING OF SUBDIVIDED STARS Muhammad Javaid
Journal of the Indonesian Mathematical Society Volume 19 Number 2 (October 2013)
Publisher : IndoMS

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

Abstract

 DOI : http://dx.doi.org/10.22342/jims.19.2.26.67-77  
EQUIVALENCE OF n-NORMS ON THE SPACE OF p-SUMMABLE SEQUENCES Anwar Mutaqin; Hendra Gunawan
Journal of the Indonesian Mathematical Society Volume 16 Number 1 (April 2010)
Publisher : IndoMS

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

Abstract

We study the relation between two known n-norms on lp, the space ofp-summable sequences. One n-norm is derived from GÄahler's formula (1969), whilethe other is due to Gunawan (2001). We show in particular that the convergence inone n-norm implies that in the other. The key is to show that the convergence ineach of these n-norms is equivalent to that in the usual norm on lp.DOI : http://dx.doi.org/10.22342/jims.16.1.27.1-7
RECIPES FOR BUILDING THE DUAL OF CONIC OPTIMIZATION PROBLEM Diah Chaerani
Journal of the Indonesian Mathematical Society Volume 16 Number 1 (April 2010)
Publisher : IndoMS

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

Abstract

Building the dual of the primal problem of Conic Optimization (CO) isa very important step to make the ¯nding optimal solution. In many cases a givenproblem does not have the simple structure of CO problem (i.e., minimizing a linearfunction over an intersection between a±ne space and convex cones) but there areseveral conic constraints and sometimes also equality constraints. In this paper wedeal with the question how to form the dual problem in such cases. We discuss theanswer by considering several conic constraints with or without equality constraints.The recipes for building the dual of such cases is formed in standard matrix forms,such that it can be used easily on the numerical experiment. Special attention isgiven to dual development of special classes of CO problems, i.e., conic quadraticand semide¯nite problems. In this paper, we also brie°y present some preliminariestheory on CO as an introduction to the main topic.DOI : http://dx.doi.org/10.22342/jims.16.1.28.9-23

Page 28 of 63 | Total Record : 625

 26   27   28   29   30 

Filter by Year

2007 2026


Reset
Filter By Issues
All Issue Vol. 32 No. 1 (2026): MARCH Vol. 31 No. 4 (2025): DECEMBER 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