Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAKCE International Journal of Graphs and Combinatorics, Volume 20
Volume 20, Number 1, January 2023
- Nafiseh Ebrahimi, Jafar Amjadi, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
Quasi-total Roman reinforcement in graphs. 1-8 - Shufei Wu, Jianfeng Hou:
Graph partitioning: an updated survey. 9-19 - Zhihua Chen, Saeed Kosari
, Saber Omidi, Narges Mehdipoor, Ali Asghar Talebi, Hossein Rashmanlou:
Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A. 20-28 - Saeid Alikhani, Mohammad R. Piri:
On the edge chromatic vertex stability number of graphs. 29-34 - M. Basher:
The reflexive edge strength of toroidal fullerene. 35-39 - A. Mallika, J. Ahamed Thamimul Ansari:
Binding number for coprime graph of groups. 40-46 - Baogen Xu, Ting Lan, Junxia Zhang, Mengmeng Zheng:
On balanced cycle domination of graphs. 47-51 - Parvin Jalilolghadr, Ali Behtoei:
Total dominator chromatic number of Kneser graphs. 52-56 - Mohammad Ali Manian, Shahram Heidarian, Farhad Khaksar Haghani:
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs. 57-60 - Phillip Mafuta, Simon Mukwembi:
Average distance and connected domination. 61-64 - Xiao-Min Zhu, Xu Yang:
Hitting times for random walks on tricyclic graphs. 65-72 - Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi:
Hop total Roman domination in graphs. 73-78 - Aqib Khan, Pratima Panigrahi, Swarup Kumar Panda:
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials. 79-90 - Mona Gholamnia Taleshani, Ahmad Abbasi:
Wiener index and addressing of some finite graphs. 91-97 - Jing Wang, Zuozheng Zhang, Yuanqiu Huang:
The generalized 3-connectivity of burnt pancake graphs and godan graphs. 98-103
Volume 20, Number 2, May 2023
- Narayana Sabhahit:
Foreword. 105 - R. B. Bapat, Manjunatha Prasad Karantha, Stephen J. Kirkland, Simo Puntanen, S. Arumugam:
Preface. 106-107 - Umashankara Kelathaya, Ravindra B. Bapat, Manjunatha Prasad Karantha:
Generalized inverses in graph theory. 108-114 - Sumathi S., G. Hannah Grace:
Selection of activators in finding the burning number. 115-119 - Bijoya Bardhan, Mausumi Sen, Debashish Sharma:
Two inverse eigenvalue problems for matrices whose graphs are trees. 120-124 - Sasmita Barik, Sane Umesh Reddy, Gopinath Sahoo:
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs. 125-133 - Sasmita Barik, Sane Umesh Reddy:
Number of cycles of small length in a graph. 134-147 - Vinay Madhusudanan, G. Sudhakara, Arjit Seth:
Descending endomorphism graphs of groups. 148-155 - Abraham Berman:
Completely positive graphs and entanglement of quantum states. 156-158 - Jiaqi Gu, Yiming Wei:
Even order uniform hypergraph via the Einstein product. 159-167 - Iswar Mahato, M. Rajesh Kannan:
Squared distance matrices of trees with matrix weights. 168-176 - Milica Andelic, Tamara Koledin, Zoran Stanic, Jianfeng Wang:
Signed graphs with integral net Laplacian spectrum. 177-184 - Shivani Rai, Biswajit Deb:
On the first and second Zagreb indices of some products of signed graphs. 185-192 - Briji J. Chathely, Rajendra P. Deore:
Complex Hadamard graphs and Butson matrices. 193-199 - Raksha Poojary, Arathi Bhat K., Subramanian Arumugam, Manjunatha Prasad Karantha:
Stress of a graph and its computation. 200-208 - J. Maria Jeyaseeli, Gee-Choon Lau, Wai Chee Shiu, S. Arumugam:
Sudoku number of graphs. 209-216 - Vignesh Ravi, Kalyani Desikan:
Brief survey on divisor graphs and divisor function graphs. 217-225
a service of 
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-04-26 18:26 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
