default search action
Electronic Journal of Graph Theory and Applications, Volume 10
Volume 10, Number 1, March 2022
- Faisal Susanto
, Kristiana Wijaya, I Wayan Sudarsana, S. Slamin
Non-inclusive and inclusive distance irregularity strength for the join product of graphs. 1 - Sumedha S. Shinde
Degree sum adjacency polynomial of standard graphs and graph operations. 15 - Zata Yumni Awanis
The strong 3-rainbow index of edge-comb product of a path and a connected graph. 33 - Mark Budden, Elijah DeJonge:
Multicolor star-critical Ramsey numbers and Ramsey-good graphs. 51 - Sebastian S. Johann, Sven O. Krumke, Manuel Streicher:
Simultaneously dominating all spanning trees of a graph. 67 - Xuanlong Ma
A survey on enhanced power graphs of finite groups. 89 - Monalisha Sharma, Rajat Kanti Nath:
Relative g-noncommuting graph of finite groups. 113 - Jayson De Luna Tolentino, Reginaldo M. Marcelo, Mark Anthony C. Tolentino
On twin edge colorings in m-ary trees. 131 - Antoon Hendrik Boode
Note on decompositions based on the vertex-removing synchronised graph product. 151 - Sanchita Paul
On some subclasses of interval catch digraphs. 157 - Zeling Shao, Huiru Geng, Zhiguo Li:
Matching book thickness of generalized Petersen graphs. 173 - Siti Humaira, Pudji Astuti, Intan Muchtadi-Alamsyah
The matrix Jacobson graph of finite commutative rings. 181 - sarah-marie belcastro
Grünbaum colorings extended to non-facial 3-cycles. 199 - Christina Eubanks-Turner, Kathryn Cole, Megan Lee:
Interlace polynomials of lollipop and tadpole graphs. 213 - Chula J. Jayawardene:
Diagonal Ramsey numbers in multipartite graphs related to stars. 227 - Hamed Karami
Perfect 2-colorings of the generalized Petersen graph GP(n, 3). 239 - Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran:
Zeroth-order general Randić index of trees with given distance k-domination number. 247
Volume 10, Number 1, April 2022
- Dalibor Froncek
Regular handicap graphs of order n ≡ 4 (mod 8). 259 - Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
Total domination number of middle graphs. 275 - Maya Nabila
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star. 289 - Darmaji, Rinurwati, Suhud Wahyudi, Suhadi Wido Saputro:
On the construction of super edge-magic total graphs. 301 - Yu Bin Tai, Gek Ling Chia, Poh-Hwa Ong:
Multi-bridge graphs are anti-magic. 311 - Ljiljana Brankovic
Computer search for graceful labeling: a survey. 319 - Shariefuddin Pirzada, Mushtaq Shah, Edy Tri Baskoro:
On 2-power unicyclic cubic graphs. 337 - Sucharita Biswas, Angsuman Das:
A generalization of Pappus graph. 345
Volume 10, Number 2, 2022
Articles</h4>
- Vladimir R. Rosenfeld:
Deriving graphs with a retracting-free bidirectional double tracing. 357-364 - Noor A'lawiah Abd Aziz, Hailiza Kamarulhaili, Farzaneh Azvin, Nader Jafari Rad
On the outer-independent double Italian domination number. 365-374 - Jan-Hendrik de Wiljes
Making graphs solvable in peg solitaire. 375-383 - Joshua Harrelson
Maximum average degree of list-edge-critical graphs and Vizing's conjecture. 385-392 - Grant Fickes, Wing Hong Tony Wong
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs. 393-414 - Muhammad Irfan, Martin Baca, Andrea Semanicová-Fenovcíková:
On reflexive edge strength of generalized prism graphs. 415-424 - Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Proximity in triangulations and quadrangulations. 425-446 - Mahla Kheibari, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
Lower and upper bounds on independent double Roman domination in trees. 447-460 - Dinny Fitriani, A. N. M. Salman
Rainbow connection number of comb product of graphs. 461-474 - Douglas Frederico Guimarães Santiago
A generalization of a Turán's theorem about maximum clique on graphs. 475-483 - Eleonora Andreotti, Raffaella Mulas
Signless normalized Laplacian for hypergraphs. 485-500 - Aarón Atilano, Sebastián Bejos, Christian Rubio-Montiel
Motions of a connected subgraph representing a swarm of robots inside a graph of work stations. 501-521 - Christian Barrientos
Relaxing the injectivity constraint on arithmetic and harmonious labelings. 523-539 - Isaac Armando Reiter, Ju Zhou:
Perfect matching transitivity of circulant graphs. 541-552 - Eunike Setiawan, Kiki Ariyanti Sugeng, Denny Riama Silaban:
On b-edge consecutive edge magic total labeling on trees. 553-563 - Yehong Shao:
Bounds on the connectivity of iterated line graphs. 565-573 - Richard M. Low, Ardak Kapbasov, Arman Kapbasov, Sergey Bereg:
Computation of new diagonal graph Ramsey numbers. 575-588 - I Wayan Sudarsana
The locating chromatic number for m-shadow of a connected graph. 589-601 - Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile:
Eternal domination and clique covering. 603-624 - Diane Christine Alar, Jonathan Celaya, Luis David García-Puente, Micah Henson, Ashley K. Wheeler:
The sandpile group of a thick cycle graph. 625-636 - I Wayan Palton Anuwiksa, Rinovia Simanjuntak, Edy Tri Baskoro:
Multipartite Ramsey Numbers of Union of Stars. 637-643 - S. Sethu Ramalingam, S. Athisayanathan:
Weak edge triangle free detour number of a graph. 645-658 - Dalibor Froncek
On families of 2-nearly Platonic graphs. 659-684
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-22 19:32 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: