default search action
AKCE International Journal of Graphs and Combinatorics, Volume 15
Volume 15, Number 1, April 2018
- Aloysius Godinho, Tarkeshwar Singh:
Some distance magic graphs. 1-6 - Riyan Wicaksana Putra, Yeni Susanti:
On total edge irregularity strength of centralized uniform theta graphs. 7-13 - Mahdi Amani:
Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees. 14-21 - Faisal Susanto:
On super (a, d)-Cn-antimagic total labeling of disjoint union of cycles. 22-26 - N. B. Mumba, Eric C. Mwambene:
Automorphism groups of graph covers and uniform subset graphs. 27-30 - Thomas Zaslavsky:
Negative (and positive) circles in signed graphs: A problem collection. 31-48 - S. A. Mane:
Structure connectivity of hypercubes. 49-52 - Morteza Faghani, Gyula O. H. Katona:
Results on the Wiener profile. 53-62 - Purnima Gupta, Rajesh Singh:
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II. 63-71 - Mohamed Bouzefrane, Saliha Ouatiki:
On the global offensive alliance in unicycle graphs. 72-78 - Sasmita Barik, Gopinath Sahoo:
Results on Laplacian spectra of graphs with pockets. 79-87 - Akbar Jahanbani:
Lower bounds for the energy of graphs. 88-96 - T. Tamizh Chelvam, Thangaraj Asir:
Genus of total graphs from rings: A survey. 97-104 - Tao-Ming Wang, Guang-Hui Zhang:
On edge-graceful labeling and deficiency for regular graphs. 105-111 - Deepa Sinha, Anita Kumari Rao:
A note on co-maximal graphs of commutative rings. 112-114
Volume 15, Number 2, August 2018
- Kahina Ouazine, Hachem Slimani, Abdelkamel Tari:
Alliances in graphs: Parameters, properties and applications - A survey. 115-154 - Kannan Pattabiraman:
Inverse sum indeg index of graphs. 155-167 - Siddharth Bhatia, Kunal Lad, Rajiv Kumar:
Bend-optimal orthogonal drawings of triconnected plane graphs. 168-173 - Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
On Ramsey (4K2, P3)-minimal graphs. 174-186 - Mohammed M. M. Jaradat, Mohammad Saleh Bataineh, Tomás Vetrík, Ayat M. M. Rabaiah:
A note on the Ramsey numbers for theta graphs versus the wheel of order 5. 187-189 - Pawaton Kaemawichanurat, Thiradet Jiarasuksakun:
Some results on the independence number of connected domination critical graphs. 190-196 - Jung Kyu Park, Jaeho Kim:
Big data storage configuration and performance evaluation utilizing NDAS storage systems. 197-201 - Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura:
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges. 202-210 - Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Client-server and cost effective sets in graphs. 211-218 - Sergei G. Chernyi:
Techniques for selecting topology and implementing the distributed control system network for maritime platforms. 219-223 - Simon Davis:
Zeta functions from graphs. 224-228
Volume 15, Number 3, December 2018
- A. Mallika, Rukhmoni Kala:
Nilpotent graphs with crosscap at most two. 229-237 - Rikio Ichishima, Akito Oshima:
On the beta-number of linear forests with an even number of components. 238-241 - Sylwia Cichacz, Irmina A. Ziolo:
2-swappable graphs. 242-250 - Paul A. Burchett, R. Douglas Chatham:
Some results for chessboard separation problems. 251-260 - Arpita Das, Pratima Panigrahi:
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs. 261-270 - Wenhui Ma, Guanghua Dong, Yingyu Lu, Ning Wang:
Lexicographic product graphs Pm[Pn] are antimagic. 271-283 - Dijian Wang, Yaoping Hou, Zikai Tang:
The adjacency spectrum of two new operations of graphs. 284-290 - Nurdin Hinding, Dian Firmayasari, Hasmawati Basir, Martin Baca, Andrea Semanicová-Fenovcíková:
On irregularity strength of diamond network. 291-297 - Koko K. Kayibi, Shariefuddin Pirzada, T. A. Chishti:
Sampling contingency tables. 298-306 - Ivan Gutman, Boris Furtula, Vladimir Katanic:
Randić index and information. 307-312
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.