default search action
Electronic Journal of Graph Theory and Applications, Volume 5
Volume 5, Number 1, 2017
- Nader Jafari Rad
:
A note on the edge Roman domination in trees. 1-6 - Phan-Thuan Do, Ngoc-Khang Le, Van-Thieu Vu:
Efficient maximum matching algorithms for trapezoid graphs. 7-20 - Keith Driscoll, Elliot Krop
All trees are six-cordial. 21-35 - S. M. Hosseini Moghaddam, Doost Ali Mojdeh
On the signed 2-independence number of graphs. 36-42 - Anie Lusiani, Edy Tri Baskoro
On size multipartite Ramsey numbers for stars versus paths and cycles. 43-50 - Padmapriya Puttaswamy, Veena Mathad:
The eccentric-distance sum of some graphs. 51-62 - S. Morteza Mirafzal, Ali Zafari
On the spectrum of a class of distance-transitive graphs. 63-69 - Ali Reza Ashrafi, Ahmad Gholami, Zeinab Mehranian:
Automorphism group of certain power graphs of finite groups. 70-82 - Omid Khormali:
On the connectivity of k-distance graphs. 83-93 - Debdas Mishra, Sushant Kumar Rout, Puma Chandra Nayak:
Some new graceful generalized classes of diameter six trees. 94-111 - Alain Valette:
Spectra of graphs and the spectral criterion for property (T). 112-116 - Karuvachery Pravas, Ambat Vijayakumar:
On an edge partition and root graphs of some classes of line graphs. 117-131 - Vladimir R. Rosenfeld:
Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs. 132-141 - Monther R. Alfuraidan
Inverse graphs associated with finite groups. 142-154 - Denny Riama Silaban
Restricted size Ramsey number for path of order three versus graph of order five. 155-162
Volume 5, Number 2, 2017
Articles
- V. Yegnanarayanan
On some aspects of the generalized Petersen graph. 163-178 - Suk Jai Seo, Peter J. Slater:
Open-independent, open-locating-dominating sets. 179-193 - Mehdi Alaeiyan, Ayoob Mehrabani:
Perfect 3-colorings of the cubic graphs of order 10. 194-206 - Hamed Ghasemian Zoeram, Daniel Yaqubi
Spanning k-ended trees of 3-regular connected graphs. 207-211 - Ngurah Anak Agung Gede, Rinovia Simanjuntak
Super edge-magic labeling of graphs: deficiency and maximality. 212-220 - Thodoris Karatasos, Evi Papaioannou:
"Transit data"-based MST computation. 221-240 - Kijung Kim
The competition numbers of Johnson graphs with diameter four. 241-246 - Steven Schluchter, Justin Z. Schroeder
Self-dual embeddings of K_{4m, 4n} in different orientable and nonorientable pseudosurfaces with the same Euler characteristic. 247-263 - Radoslaw Cymer:
A note on extreme sets. 264-275 - Kamal Lochan Patra, Binod Kumar Sahoo:
Bounds for the Laplacian spectral radius of graphs. 276-303 - Bryan J. Freyberg, Melissa S. Keranen:
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles. 304-311 - I Nengah Suparta
Some classes of bipartite graphs induced by Gray codes. 312-324 - Faraha Ashraf, Martin Baca
On H-irregularity strengths of G-amalgamation of graphs. 325-334 - Mustapha Aouchiche
On the nullity number of graphs. 335-346 - Amrita Acharyya, Jon M. Corson, Bikash Das:
Cofinite graphs and their profinite completions. 347-373
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: