Electronic Journal of Graph Theory and Applications (EJGTA)

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung (ITB) Indonesia, Indonesian Combinatorial Society (InaCombS), and GTA Research Group, the University of Newcastle, Australia.

The online subscription to EJGTA is free. Full-text access to all papers is available for free.

All research articles as well as surveys and articles of more general interest are welcome. All papers will be refereed in the normal manner of mathematical journals to maintain the highest standards.

This journal is sponsored by Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung (ITB), Faculty of Computer Science University of Jember and Ministry of Research, Technology and Higher Education, Indonesia.


Vol 7, No 1 (2019): Electronic Journal of Graph Theory and Applications

Electronic Journal of Graph Theory and Applications Vol. 7 No. 1 (2019)

Table of Contents

Articles

On friendly index sets of k-galaxies
S-M Lee, Richard M. Low, H.K. Ng, Y-C Wang
PDF
1-10
Graceful labeling of triangular extension of complete bipartite graph
Sarbari Mitra, Soumya Bhoumik
PDF
11-30
On the Erdos-Ko-Rado property of finite groups of order a product of three primes
Modjtaba Ghorbani, Mina Rajabi-Parsa
PDF
31-42
On the spectrum of linear dependence graph of a finite dimensional vector space
Sushobhan Maity, A. K. Bhuniya
PDF
43-59
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
Michael Haythorpe, Andrew Johnson
PDF
61-75
On the complexity of some hop domination parameters
Nader Jafari Rad, Elahe Shabani
PDF
77–89
Metric dimension of fullerene graphs
Shehnaz Akhter, Rashid Farooq
PDF
91–103
Clique roots of K4-free chordal graphs
Hossein Teimoori Faal
PDF
105–111
The connected size Ramsey number for matchings versus small disconnected graphs
Hilda Assiyatun, Budi Rahadjeng, Edy Tri Baskoro
PDF
113–119
Outer independent global dominating set of trees and unicyclic graphs
Doost Ali Mojdeh, Mortaza Alishahi
PDF
121–145
Maximum cycle packing using SPR-trees
Christin Otto, Peter Recht
PDF
147–155
On the super edge-magic deficiency of join product and chain graphs
Anak Agung Gede Ngurah, Rinovia Simanjuntak
PDF
157–167
Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network
Pushparaj Shetty D., M. Prasanna Lakshmi
PDF
169–182
The 4-girth-thickness of the complete multipartite graph
Christian Rubio-Montiel
PDF
183–188
The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
Vladimir R. Rosenfeld
PDF
189–205