Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Journal of Graph Theory and Applications, Volume 9
Volume 9, Number 1, 2021
Articles
- Thomas Schweser
, Michael Stiebitz:
Vertex partition of hypergraphs and maximum degenerate subhypergraphs. 1-9 - Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Total weight choosability for Halin graphs. 11-24 - Ngurah Anak Agung Gede, Rinovia Simanjuntak:
On distance labelings of 2-regular graphs. 25-37 - Sivakumar Karunakaran, Lavanya Selvaganesh:
A unique and novel graph matrix for efficient extraction of structural information of networks. 39-51 - Mohamed Benattalah, Mustapha Chellali, Noureddine Ikhlef Eschouf:
Some new results on the b-domatic number of graphs. 53-64 - K. G. Sreekumar, K. Manilal:
Automorphism groups of some families of bipartite graphs. 65-75 - Saeid Alikhani, Samaneh Soltani:
Distinguishing index of Kronecker product of two graphs. 77-85 - Tyler Seacrest:
Multi-switch: A tool for finding potential edge-disjoint 1-factors. 87-94 - Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
Roman domination in oriented trees. 95-103 - Sunilkumar M. Hosamani, Shailaja S. Shirkol, Preeti B. Jinagouda, Marcin Krzywkowski:
Degree equitable restrained double domination in graphs. 105-111 - Angsuman Das:
Connected domination value in graphs. 113-123 - Roshni T. Roy, Koombail Shahul Hameed, K. Augustine Germina:
On two Laplacian matrices for skew gain graphs. 125-135 - Italo J. Dejter:
A numeral system for the middle-levels graphs. 137-156 - Alf Kimms:
The structure of the 3x + 1 problem. 157-174 - Samane Bakaein, Mostafa Tavakoli, Freydoon Rahbarnia:
Perfect codes in some products of graphs. 175-184 - Zbigniew R. Bogdanowicz:
Hyper-Hamiltonian circulants. 185-193 - Dalibor Froncek, Mahdi Reza Khorsandi, Seyed Reza Musawi, Jiangyi Qiu:
A note on nearly Platonic graphs with connectivity one. 195-205 - Thomas Gardemann, Katja Mönius:
Constructions of new integral graph families. 207-213 - Novi H. Bong, Yuqing Lin:
Some properties of the multiset dimension of graphs. 215-221 - Fahimeh Esmaeeli, Ahmad Erfanian, Madjid Mirzavaziri:
Vector weighted Stirling numbers and an application in graph theory. 223-234
Volume 9, Number 2, 2021
- Deepak Sehrawat, Bikash Bhattacharjya:
Non-isomorphic signatures on some generalised Petersen graph. 235-256 - Zoran Stanic:
Lower bounds for the algebraic connectivity of graphs with specified subgraphs. 257-264 - Prashant Pralhad Malavadkar, Santosh Baburao Dhotre, Maruti Shikare:
On n-connected minors of the es-splitting binary matroids. 265-276 - M. Alambardar Meybodi, Mohammad Reza Hooshmandasl, Pouyeh Sharifani, Ali Shakiba:
On the k-rainbow domination in graphs with bounded tree-width. 277-300 - Ugur Odabasi, Dan Roberts, Richard M. Low:
The integer-antimagic spectra of Hamiltonian graphs. 301-308 - B. Basavanagoud, Praveen Jakkannavar, Shruti Policepatil:
Integrity of total transformation graphs. 309-330 - Shariefuddin Pirzada, Bilal A. Rather, T. A. Chishti, U. Samee:
On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn. 331-346 - Július Czap, Peter Sugerek:
Odd facial colorings of acyclic plane graphs. 347-356 - Christian Barrientos, Sarah M. Minion:
Harmonious graphs from α-trees. 357-376 - Roland Lortz, Ingrid Mengersen:
All missing Ramsey numbers for trees versus the four-page book. 377-386 - Meilin I. Tilukay, Pranaya D. M. Taihuttu, A. N. M. Salman, Francis Y. Rumlawang, Zeth A. Leleury:
Complete bipartite graph is a totally irregular total graph. 387-396 - Mark Budden, William Stiles:
Anti-Ramsey Hypergraph Numbers. 397-408 - Jared Culbertson, Dan P. Guralnik, Peter F. Stiller:
Edge erasures and chordal graphs. 409-418 - Reza Sharafdini, Ali Zeydi Abdian:
Tarantula graphs are determined by their Laplacian spectrum. 419-432 - Wei Zheng, Hajo Broersma, Ligong Wang:
On hamiltonicity of 1-tough triangle-free graphs. 433-442 - Kazutaka Ikeda, Kenjiro Ogawa, Satoshi Tagusari, Shin-Ichiro Tashiro, Morimasa Tsuchiya:
On strict-double-bound numbers of graphs and cut sets. 443-450 - Amber Armstrong, Ryan C. Bunge, William Duncan, Saad I. El-Zanati, Kristin Koe, Rachel Stutzman:
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4. 451-468 - Doost Ali Mojdeh, Guoliang Hao, Iman Masoumi, Ali Parsian:
Unique response strong Roman dominating functions of graphs. 469-484 - Fawwaz Fakhrurrozi Hadiputra, Kiki A. Sugeng, Denny Riama Silaban, Tita Khalis Maryati, Dalibor Froncek:
Chromatic number of super vertex local antimagic total labelings of graphs. 485-498 - Thomas Lange:
Representing non-crossing cuts by phylogenetic trees. 499-506 - R. Sundara Rajan, A. Arul Shantrinal, T. M. Rajalaxmi, Jianxi Fan, Weibei Fan:
Embedding complete multi-partite graphs into Cartesian product of paths and cycles. 507-526 - Cristina Dalfó, Miguel Angel Fiol:
On d-Fibonacci digraphs. 527-538 - Edy Tri Baskoro, Nobuaki Obata:
Determining finite connected graphs along the quadratic embedding constants of paths. 539-560 - I Wayan Sudarsana:
A note on the Ramsey number for cycle with respect to multiple copies of wheels. 561-566 - Suzana Antunovic, Damir Vukicevic:
Evaluating topological ordering in directed acyclic graphs. 567-580
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-06-21 21:32 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:
