default search action
AKCE International Journal of Graphs and Combinatorics, Volume 17
Volume 17, Number 1, 2020
- Saeid Alikhani
, Samaneh Soltani:
The distinguishing number and the distinguishing index of line and graphoidal graph(s). 1-6 - Kiyoshi Hosono, Masatsugu Urabe:
Specified holes with pairwise disjoint interiors in planar point sets. 7-15 - Srinivasa Rao Kola
Some classes of trees with maximum number of holes two. 16-24 - D. Sarala, Hanyuan Deng, C. Natarajan, S. K. Ayyaswamy:
F index of graphs based on four new operations related to the strong product. 25-37 - Qingyun Tao, Yaoping Hou:
-borderenergetic graphs. 38-44 - Ali Zeydi Abdian, Afshin Behmaram, Gholam Hossein Fath-Tabar:
Graphs determined by signless Laplacian spectra. 45-50 - Dushyant Tanna
Vertex irregular reflexive labeling of prisms and wheels. 51-59 - Manju Raju, Kiran R. Bhutani, Babak Moazzez, S. Arumugam
On -domination in graphs. 60-64 - Moein Pourbaba, Habib Azanchiler, Ghodratolah Azadi:
A new matroid constructed by the rank function of a matroid. 65-69 - Martin Kochol:
Modifications of Tutte-Grothendieck invariants and Tutte polynomials. 70-73 - Ivan Gutman, Emina I. Milovanovic, Igor Z. Milovanovic:
Beyond the Zagreb indices. 74-85 - Magda Dettlaff, Magdalena Lemanska, Jerzy Topp
Certified domination. 86-97 - Harishchandra S. Ramane
Status connectivity indices and co-indices of graphs and its computation to some distance-balanced graphs. 98-108 - Saad Ihsan Butt
Face antimagic labelings of toroidal and Klein bottle grid graphs. 109-117 - Bijon Biswas, Raibatak Sen Gupta, Malay K. Sen, Sukhendu Kar
Some properties of Square element graphs over semigroups. 118-130 - Saeid Alikhani
The chromatic distinguishing index of certain graphs. 131-138 - Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Nicholas Phillips:
The upper domatic number of a graph. 139-148 - Ali Zeydi Abdian, Lowell W. Beineke, Mohammad Reza Oboudi
On the spectral determinations of the connected multicone graphs. 149-158 - Lata N. Kamble, Charusheela M. Deshpande, Bhagyashree Athawale:
-partite self-complementary and almost self-complementary -uniform hypergraphs. 159-167 - Shariefuddin Pirzada
Upper dimension and bases of zero-divisor graphs of commutative rings. 168-173 - G. Sethuraman, M. Sujasree:
-labeling of supersubdivided connected graph plus an edge. 174-183 - Muhammad Kamran Siddiqui
Total irregularity strength for product of two paths. 184-197 - Amrita Acharyya, Bikash Das:
Actions of cofinite groups on cofinite graphs. 198-205 - James M. Hammer
Graph polynomials for a class of DI-pathological graphs. 206-212 - Faraha Ashraf, Martin Baca
On -irregularity strength of ladders and fan graphs. 213-219 - Jaroslav Ivanco:
Gradual supermagic graphs. 220-228 - Purnima Gupta, Alka Goyal, Ranjana Jain:
Independent point-set dominating sets in graphs. 229-241 - Naoki Matsumoto:
Domatically perfect graphs. 242-251 - Gülistan Kaya Gök:
On the topological matrix and topological indices. 252-258 - Shaheena Sultana
-shaped point set embeddings of high-degree plane graphs. 259-264 - J. Deepalakshmi
On the 2-token graph of a graph. 265-268 - P. K. Niranjan
On the radio number for corona of paths and cycles. 269-275 - Radha Madhavi Duggaraju
An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes. 276-295 - Sirirat Singhun, Parichat Ruengmanee, Adthasit Sinna:
A closed -knight's tour on some cylinder chessboards. 296-302 - Hortensia Galeana-Sánchez, Miguel Tecpa-Galván:
-panchromatic digraphs. 303-313 - Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
On the strong beta-number of galaxies with three and four components. 314-323 - Anetta Szynal-Liana
Some identities for generalized Fibonacci and Lucas numbers. 324-328 - Mikio Kano, Hajime Matsumura:
Spanning trees with small diameters. 329-334 - Carlos A. Alfaro
On transversal and 2-packing numbers in uniform linear systems. 335-341 - Laxman Saha
Upper bound for radio -chromatic number of graphs in connection with partition of vertex set. 342-355 - Subarsha Banerjee
Signless Laplacian spectrum of power graphs of finite cyclic groups. 356-366 - Fendy Septyanto, Kiki Ariyanti Sugeng:
Rainbow connection number of generalized composition. 367-372 - Bryan J. Freyberg:
On constant sum partitions and applications to distance magic-type graphs. 373-379 - Mehdi Alaeiyan, Ayoob Mehrabani
Perfect 2-colorings of the cubic graphs of order less than or equal to 10. 380-386 - Rebecca E. Garcia
Characterizing graphs of critical pairs of layered generalized crowns. 387-401 - Gábor Hegedüs:
Sunflowers and -intersecting families. 402-406 - Laleh Yahyaei, S. A. Katre:
Dimension of a lobster. 407-413 - Ibrahim Tarawneh, Roslan Hasni
On the edge irregularity strength of grid graphs. 414-418 - Allan Bickle:
A short proof of Brooks' Theorem for vertex arboricity. 419-421 - Hechao Liu
The hyper-Zagreb index of cacti with perfect matchings. 422-428 - Kerry Ojakian:
A combinatorial interpretation of the bijection of Goulden and Yong. 429-442 - Yoshimi Egawa, Zhixian Zhao:
Tree in forbidden triples generating a finite set of graphs with high connectivity. 443-446 - Hayley Boynton, Ethan Burroughs, Stephanie Gaston, Jobby Jacob:
Graphs with large rank numbers and rank numbers of subdivided stars. 447-452 - S. Kavitha, Rukhmoni Kala:
A note on comaximal ideal graph of commutative rings. 453-460 - Nainarraj Kamatchi
On group vertex magic graphs. 461-465 - Sasmita Barik, Gopinath Sahoo:
A new matrix representation of multidigraphs. 466-479 - Simon Joyce
Strongly connectable digraphs and non-transitive dice. 480-485 - Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
On the strength of some trees. 486-494 - Meilin I. Tilukay, A. N. M. Salman
The total face irregularity strength of some plane graphs. 495-502 - Arezoo N. Ghameshlou
Lower bounds on nonnegative signed domination parameters in graphs. 503-509 - C. Chithra, G. Marimuthu, G. Kumar:
-supermagic labeling of graphs. 510-518 - Manoj Changat
Transit sets of -point crossover operators. 519-533 - Zbigniew R. Bogdanowicz
Identifying Hamilton cycles in the Cartesian product of directed cycles. 534-538 - Stephan Dominique Andres:
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs. 539-549 - S. Rajeswari, A. Somasundaram, Nishrin Abdul Gafoor, Trupti Gokhele Swarup
A computational approach to identify the role of potassium transporter in barley. 550-559 - L. Hamidian Jahromi, A. Abbasi:
On the genus of some total graphs. 560-570 - Sunil Kumar R., Kannan Balakrishnan:
Betweenness centrality in Cartesian product of graphs. 571-583 - Vahan V. Mkrtchyan, Gagik N. Vardanyan:
On two consequences of Berge-Fulkerson conjecture. 584-586 - Changxiang He, Weilong Liu, Baofeng Wu, Zhensheng Yu, Min Chang:
Minimum fundamental cycle basis of some bipartite graphs. 587-591 - G. Sethuraman, V. Murugan:
Generating graceful unicyclic graphs from a given forest. 592-605 - Ali Zeydi Abdian, Krishnaiyan Thulasiraman, Kewen Zhao:
The spectral characterization of the connected multicone graphs. 606-613 - Suresh Manjanath Hegde, Suresh Dara:
Further results on Erdős-Faber-Lovász conjecture. 614-631 - P. Ragukumar
Binomial trees are graceful. 632-636
Volume 17, Number 2, 2020
- S. Arumugam
Preface. 637
- Peter Dragnev
Lowell Beineke: five decades of excellence. 638-640 - Robin Wilson:
Working with Lowell. 641-645 - Gary Chartrand, Ping Zhang:
Ramsey sequences of graphs. 646-652 - Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Introduction to coalitions in graphs. 653-659 - S. Arumugam
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. 660-664 - Douglas Bauer
On the necessity of Chvátal's Hamiltonian degree condition. 665-669 - Terry A. McKee
Graphs in which every c edges that form a tree are chords of a common cycle. 670-672 - Pambe Biatch' Max, Jay S. Bagga, S. Arumugam
A survey and a new class of graceful unicylic graphs. 673-678 - Hong-Jian Lai
Catlin's reduced graphs with small orders. 679-690 - Purnima Gupta, Rajesh Singh, S. Arumugam
Graphs with equal domination and independent domination numbers. 691-696
Volume 17, Number 3, 2020
- M. Ilayaraja, Appu Muthusamy:
Decomposition of complete bipartite graphs into cycles and stars with four edges. 697-702 - Purnima Gupta, Megha Agarwal, Rajesh Singh:
On graphoidal length of a tree in terms of its diameter. 703-707 - Keith Driscoll, William F. Klostermeyer, Elliot Krop, Colton Magnant, Patrick Taylor:
On eternal domination and Vizing-type inequalities. 708-712 - Pilar Cano, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs. 713-719 - Luca Ferrarini
Normal 5-edge-colorings of a family of Loupekhine snarks. 720-724 - Zehui Shao, Zepeng Li, Bo Wang, Shaohui Wang, Xiujun Zhang:
Interval edge-coloring: A model of curriculum scheduling. 725-729 - T. Tamizh Chelvam
Complement of the generalized total graph of fields. 730-733 - Amita A. Shinde, Y. M. Borse:
On regular subgraphs of augmented cubes. 734-743 - Jonathan Gregory, Colton Magnant, Zhuojun Magnant:
Gallai-Ramsey number of an 8-cycle. 744-748 - Emrullah Kirklar, Ayse Dilek Maden
Some results on one type of graph family with some special number sequences. 749-754 - Qiang Zhu, Krishnaiyan Thulasiraman, Min Xu, Sridhar Radhakrishnan:
Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks. 755-760 - Hendy, A. N. Mudholifah, Kiki A. Sugeng, Martin Baca, Andrea Semanicová-Fenovcíková
On H-antimagic decomposition of toroidal grids and triangulations. 761-770 - N. Kalai Mathi, S. Monikandan:
Degree associated edge reconstruction number of split graphs with biregular independent set is one. 771-776 - M. Ilayaraja, K. Sowndhariya, Appu Muthusamy:
Decomposition of product graphs into paths and stars on five vertices. 777-783 - Rafik Sahbi
On the complexity of some quorum colorings problems of graphs. 784-787 - Md. Saidur Rahman
A survey on pairwise compatibility graphs. 788-795 - Christian Barrientos, Sarah M. Minion:
Folding trees gracefully. 796-800 - Mahdi Reza Khorsandi
Graphs whose line graphs are ring graphs. 801-803 - Álvaro Martínez-Pérez, Deborah Oliveros:
Critical graphs with Roman domination number four. 804-809 - Budi Utami, Kiki A. Sugeng, Suarsih Utama:
On inclusive d-distance irregularity strength on triangular ladder graph and path. 810-819 - B. S. Panda, Shaily Verma, Yash Keerti:
On the total and AVD-total coloring of graphs. 820-825 - Anupriya Jha:
Secure total domination in chain graphs and cographs. 826-832 - Matjaz Kovse
Steiner Wiener index of block graphs. 833-840 - Azam Rajabi, Ahmad Erfanian, Ali Azimi:
End-regularity of generalized bicycle graph. 841-849 - Jian Wu, Haixia Zhao:
On the maximum spectral radius of multipartite graphs. 850-855 - Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort, Christian Rubio-Montiel
The 6-girth-thickness of the complete graph. 856-861 - Laura Pastrana-Ramírez, Rocío Sánchez-López
Semicomplete absorbent sets in digraphs. 862-869 - Pouyeh Sharifani, Mohammad Reza Hooshmandasl
An explicit construction of optimal dominating and [1, 2]-dominating sets in grid. 870-876 - S. K. Vaidya, Kalpesh M. Popat
Construction of L-equienergetic graphs using some graph operations. 877-882 - Vahid Ghorbani
On the structure of spikes. 883-886 - J. Paulraj Joseph, N. Shunmugapriya:
Total resolving number of edge cycle graphs. 887-891 - N. Shanthini, J. Baskar Babujee:
On the crossing number for Kronecker product of a tripartite graph with path. 892-898 - R. Alagammai, V. Vijayalakshmi:
The game chromatic number of corona of two graphs. 899-904 - Hamid Reza Maimani, Mostafa Momeni, Farhad Rahimi Mahid, Seyed Mahmoud Sheikholeslami:
Independent double Roman domination in graphs. 905-910 - Gek Ling Chia, Wanida Hemakul, Sirirat Singhun:
Graphs with cyclomatic number three having panconnected square, II. 911-914 - Le Liu, Qiong Wu:
L(1, 2)-labeling numbers on square of cycles. 915-919 - Mubeen Javaid, Akbar Ali
On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles. 920-923 - Michael Kubesa, Tom Raiman
Factorizations of complete graphs into tadpoles. 924-934 - Elias John Thomas
Characterization of classes of graphs with large general position number. 935-939 - Nancy Jaseintha Cutinho, S. Sudha, S. Arumugam:
Distance antimagic labelings of Cartesian product of graphs. 940-942 - S. Sudha, S. Arumugam
Min-max and max-min graph saturation parameters. 943-947 - Stephan Cho, Jay Cummings, Colin Defant, Claire Sonneborn:
Anti-Ramsey theory on complete bipartite graphs. 948-951 - Dalibor Froncek, Michael McKeown:
Note on diagonal construction of Z2nm-supermagic labeling of Cn□Cm. 952-954 - Christina M. Mynhardt
The k-conversion number of regular graphs. 955-965 - Mustapha Chellali, Nader Jafari Rad
Varieties of Roman domination II. 966-984 - Harishchandra S. Ramane
Note on inverse sum indeg index of graphs. 985-987 - Adrián Vázquez-Ávila
On strong Skolem starters for ℤpq. 988-991 - Stephan Dominique Andres, Helena Bergold
A semi-strong perfect digraph theorem. 992-994 - Rinovia Simanjuntak, Palton Anuwiksa:
D-magic strongly regular graphs. 995-999 - Alejandra Brewer, Adam Gregory, Quindel Jones, Luke Rodriguez, Rigoberto Flórez, Darren Narayan:
Infinite families of asymmetric graphs. 1000-1009 - Jakkepalli Pavan Kumar
Algorithmic complexity of secure connected domination in graphs. 1010-1013 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
Extensions of Richardson's theorem for infinite digraphs and (𝒜, ℬ)-kernels. 1014-1020 - Elizabeth Donovan, Timothy Schroeder:
An algorithm for an 𝓁2-homological test for the planarity of a graph. 1021-1027 - Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder:
New resolvability parameters of graphs. 1028-1038 - Sarita Nemani, Ganesh Joshi:
E-super vertex magic labeling of cartoon flowers and wounded flowers. 1039-1044 - P. Anusha Devi, S. Monikandan:
Graphs with arbitrarily large adversary degree associated reconstruction number. 1045-1051 - Nibedita Mandal
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths. 1052-1058 - Guangnuan Li:
On balanced bipartitions of graphs. 1059-1062 - Muteb Alshammari
A single-source shortest path algorithm for dynamic graphs. 1063-1068 - Sanchita Paul
On central max-point-tolerance graphs. 1069-1075 - Siddani Bhaskara Rao, Uma Kant Sahoo, V. Parameswaran:
Cycle stochastic graphs: Structural and forbidden graph characterizations. 1076-1080 - Chakradhar Padamutham
Complexity of Roman {2}-domination and the double Roman domination in graphs. 1081-1086 - Yip C. Yiew, Gek Ling Chia, Poh-Hwa Ong:
Crossing number of Cartesian product of prism and path. 1087-1093 - Rao Li:
The matching number and Hamiltonicity of graphs. 1094-1095 - Alewyn Petrus de Villiers:
The cost of edge removal in graph domination. 1096-1102
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-11-21 20:19 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: