Vol 5, No 1 (2017)

Electronic Journal of Graph Theory and Applications

Table of Contents

Articles

A note on the edge Roman domination in trees
Nader Jafari Rad
PDF
1-6
Efficient maximum matching algorithms for trapezoid graphs
Phan-Thuan Do, Ngoc-Khang Le, Van-Thieu Vu
PDF
7-20
All trees are six-cordial
Keith Driscoll, Elliot Krop, Michelle Nguyen
PDF
21-35
On the signed $2$-independence number of graphs
S.M. Hosseini Moghaddam, D.A. Mojdeh, Babak Samadi, Lutz Volkmann
PDF
36-42
On size multipartite Ramsey numbers for stars versus paths and cycles
Anie Lusiani, Edy Tri Baskoro, Suhadi Wido Saputro
PDF
43-50
The eccentric-distance sum of some graphs
Padmapriya P, Veena Mathad
PDF
51-62
On the spectrum of a class of distance-transitive graphs
Seyed Morteza Mirafzal, Ali Zafari
PDF
63-69
Automorphism group of certain power graphs of finite groups
Ali Reza Ashrafi, Ahmad Gholami, Zeinab Mehranian
PDF
70-82
On the connectivity of $k$-distance graphs
Omid Khormali
PDF
83-93
Some new graceful generalized classes of diameter six trees
Debdas Mishra, Sushant Kumar Rout, Puma Chandra Nayak
PDF
94-111
Spectra of graphs and the spectral criterion for property (T)
Alain Valette
PDF
112–116
On an edge partition and root graphs of some classes of line graphs
K Pravas, A. Vijayakumar
PDF
117–131
Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs
Vladimir R. Rosenfeld
PDF
132–141
Inverse graphs associated with finite groups
Monther Rashed Alfuraidan, Yusuf F. Zakariya
PDF
142–154
Restricted size Ramsey number for path of order three versus graph of order five
Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa
PDF
155–162