Vol 10, No 2 (2022)

Electronic Journal of Graph Theory and Applications

Table of Contents

Articles

Deriving graphs with a retracting-free bidirectional double tracing
Vladimir R. Rosenfeld
PDF
357 - 364
On the outer-independent double Italian domination number
Noor A'lawiah Abd Aziz, Hailiza Kamarulhaili, Farzaneh Azvin, Nader Jafari Rad
PDF
365 - 374
Making graphs solvable in peg solitaire
Jan-Hendrik de Wiljes, Martin Kreh
PDF
375 - 383
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
Joshua Harrelson, Hannah Reavis
PDF
385 - 392
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
Grant Fickes, Wing Hong Tony Wong
PDF
393 - 414
On reflexive edge strength of generalized prism graphs
Muhammad Irfan, Martin Baca, Andrea Semanicova-Fenovcikova
PDF
415 - 424
Proximity in triangulations and quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen, László Székely
PDF
425 - 446
Lower and upper bounds on independent double Roman domination in trees
M. Kheibari, Hossein Abdollahzadeh Ahangar, R. Khoeilar, S.M. Sheikholeslami
PDF
447 - 460
Rainbow connection number of comb product of graphs
Dinny Fitriani, ANM Salman, Zata Yumni Awanis
PDF
461 - 474
A generalization of a Turán’s theorem about maximum clique on graphs
Douglas Frederico Guimarães Santiago, Anderson Luiz Pedrosa Porto, Kaio Ariel Silva Sá
PDF
475 - 483
Signless normalized Laplacian for hypergraphs
Eleonora Andreotti, Raffaella Mulas
PDF
485 - 500
Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
Aarón Atilano, Sebastian Bejos, Christian Rubio-Montiel
PDF
501 - 521
Relaxing the injectivity constraint on arithmetic and harmonious labelings
Christian Barrientos, Maged Z Youssef
PDF
523 - 539
Perfect matching transitivity of circulant graphs.
Isaac Armando Reiter, Ju Zhou
PDF
541 - 552
On b-edge consecutive edge magic total labeling on trees
Eunike Setiawan, Kiki Ariyanti Sugeng, Denny Riama Silaban
PDF
553 - 563
Bounds on the connectivity of iterated line graphs
Yehong Shao
PDF
565 - 573
Computation of new diagonal graph Ramsey numbers
Richard M. Low, Ardak Kapbasov, Arman Kapbasov, Sergey Bereg
PDF
575 - 588
The locating chromatic number for m-shadow of a connected graph
I Wayan Sudarsana, Faisal Susanto, Selvy Musdalifah
PDF
589 - 601
Eternal domination and clique covering
Gary MacGillivray, C. M. Mynhardt, Virgélot Virgile
PDF
603 - 624
The sandpile group of a thick cycle graph
Diane Christine Alar, Jonathan Celaya, Luis David Garcia Puente, Micah Henson, Ashley K. Wheeler
PDF
625 - 636
Multipartite Ramsey numbers for the union of stars
I Wayan Palton Anuwiksa, Rinovia Simanjuntak, Edy Tri Baskoro
PDF
637 - 643
Weak edge triangle free detour number of a graph
Sethu Ramalingam, S. Athisayanathan
PDF
645 - 658
On families of 2-nearly Platonic graphs
Dalibor Froncek, Mahdi Reza Khorsandi, Seyed Reza Musawi, Jiangyi Qiu
PDF
659 - 684