default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAKCE International Journal of Graphs and Combinatorics, Volume 19
Volume 19, Number 1, January 2022
- Saraswati Bajaj, Pratima Panigrahi:
Universal adjacency spectrum of zero divisor graph on the ring and its complement. 1-17 - V. C. Amritha, K. Selvakumar:
Ideal based hypergraph of a commutative ring. 18-23 - Sahil Sharma
, Vijay Kumar Bhat:
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings. 24-30 - Jiashang Jiang:
An existence theorem on fractional ID-(g, f)-factor-critical covered graphs. 31-35 - Angelina Y. M. Chin, Hamid Reza Maimani, Mohammad Reza Pournaki, M. Sivagami, T. Tamizh Chelvam:
Unitary Cayley graphs whose Roman domination numbers are at most four. 36-40 - S. Ramachandran:
A property of most of the known non-reconstructible digraphs. 41-48 - Yongsheng Rao, Saeed Kosari, Hao Guan, Maryam Akhoundi, Saber Omidi:
A short note on the left A-Γ-hyperideals in ordered Γ-semihypergroups. 49-53 - Chayapa Darayon, Wipawee Tangjai:
Rainbow vertex-connection number on a small-world Farey graph. 54-60 - Nadeem ur Rehman, Mohd Nazim, K. Selvakumar:
On the planarity, genus and crosscap of new extension of zero-divisor graph of commutative rings. 61-68 - M. Aijaz, Shariefuddin Pirzada, A. Somasundaram:
Zero-divisor graphs of unitary R-modules over commutative rings. 69-73 - Hossein Abdollahzadeh Ahangar:
Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties. 74-78 - Artchariya Muaengwaeng, Ratinan Boonklurb, Sirirat Singhun:
Vertex pancyclicity over lexicographic products. 79-86 - K. Prabha Ananthi, T. Tamizh Chelvam:
Reduced non-zero component union graph of free semi-modules. 87-93
Volume 19, Number 2, May 2022
- Supachoke Isariyapalakul, Witsarut Pho-on, Varanoot Khemmani:
Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number. 95-101 - Payal, Sangita Kansal:
Structural matrices for Signed Petri net. 102-107 - Arockiam Lourdusamy, Irudaya Raj Dhivviyanandam, S. Kither Iammal:
Monophonic pebbling number and t-pebbling number of some graphs. 108-111 - Rajesh Singh, Purnima Gupta, S. Arumugam:
Truly non-trivial graphoidal graphs. 112-117 - Afsaneh Rezaei, Kazem Khashyarmanesh, Mojgan Afkhami:
On the metric dimension of Cayley graphs. 118-124 - Yasmeen Akhtar:
A hyperedge coloring and application in combinatorial testing. 125-132 - Nibedita Mandal, Pratima Panigrahi:
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs. 133-140 - D. Saranya, S. Jeevadoss:
Decomposition of hypercube graphs into paths and cycles of length four. 141-145 - Bilal A. Rather, Mustapha Aouchiche, Shariefuddin Pirzada:
On the spread of the geometric-arithmetic matrix of graphs. 146-153 - Seema Varghese, Seethu Varghese, Ambat Vijayakumar:
Power domination in Mycielskian of spiders. 154-158 - Seena Varghese, S. Aparna Lakshmanan, S. Arumugam:
Two extensions of Leech labeling to the class of all graphs. 159-165
Volume 19, Number 3, September 2022
- Fu-Tao Hu, Mei-Yu Sun:
Induced subgraph and eigenvalues of some signed graphs. 167-170 - Xiaohong Chen, Baoyindureng Wu:
Domination number and feedback vertex number of complements of line graphs. 171-176 - Jishnu Sen, Srinivasa Rao Kola:
Broadcast domination of lexicographic and modular products of graphs. 177-181 - Jay S. Bagga, Lowell W. Beineke:
New results and open problems in line graphs. 182-190 - Akbar Jahanbani, Seyed Mahmoud Sheikholeslami:
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs. 191-196 - Yuan Chen, Guowei Dai:
Binding number and path-factor critical deleted graphs. 197-200 - Deepti Jain, Purnima Gupta:
Independent 2-point set domination in graphs - II. 201-205 - Fatemeh Nahani Pour, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
An improved upper bound on the independent double Roman domination number of trees. 206-210 - Priyamvada, B. S. Panda:
Exact square coloring of graphs resulting from some graph operations and products. 211-220 - Huiqin Jiang, Zehui Shao:
Quasi-total Roman bondage number in graphs. 221-228 - Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi:
Total mixed domination in graphs. 229-237 - Praveen Mathil, Barkha Baloda, Jitender Kumar:
On the cozero-divisor graphs associated to rings. 238-248 - Mengmeng Liu, Shengjin Ji:
On minimum revised edge Szeged index of bicyclic graphs. 249-254 - Bo Zhu, Shumin Zhang, Jinyu Zou, Chengfu Ye:
Two kinds of conditional connectivity of hypercubes. 255-260 - Kazhal Haghparast, Jafar Amjadi, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
On [k]-Roman domination subdivision number of graphs. 261-267 - S. Balamoorthy, S. V. Bharanedhar, N. Kamatchi:
On the products of group vertex magic graphs. 268-275 - Fouzul Atik, Priti Prasanna Mondal, Firdoshi Parveen:
On the distance spectra of m-generation n-prism graph. 276-281 - Mohammed M. M. Jaradat, A. Baniabedalruhman, Mohammed S. A. Bataineh, A. M. M. Jaradat, A. A. Al-Rhayyel:
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order. 282-286 - Siti Zahidah, Karine Lutfiah Oktaviana, Yayuk Wahyuni, Liliek Susilowati, Ahmad Erfanian:
Twin g-noncommuting graph of a finite group. 287-295 - Yogendra Singh, Anand Kumar Tiwari:
Doubly semi-equivelar maps on the plane and the torus. 296-310 - Abdelkader Rahmouni, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
Further results on independent double roman trees. 311-315 - Thangaraj Asir, V. Rabikka, A. M. Anto, N. Shunmugapriya:
Wiener index of graphs over rings: a survey. 316-324 - Kijung Kim:
On the D-differential of a graph. 325-329
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 2026-08-24 23:30 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
