Geodesic

Sommaire du Fascicule no. 1

Gregarious Kite Factorization of Tensor Product of Complete Graphs
p. 7-24
Bounds on the Locating-Total Domination Number in Trees
p. 25-34
Decompositions of Cubic Traceable Graphs
p. 35-49
Conflict-Free Vertex-Connections of Graphs
p. 51-65
On the Metric Dimension of Directed and Undirected Circulant Graphs
p. 67-76
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
p. 77-84
2-Connected Hamiltonian Claw-Free Graphs Involving Degree Sum of Adjacent Vertices
p. 85-106
The Proper Diameter of a Graph
p. 107-125
The Compared Costs of Domination Location-Domination and Identification
p. 127-147
On the Minimum Number of Spanning Trees in Cubic Multigraphs
p. 149-159
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
p. 161-179
On Total H-Irregularity Strength of the Disjoint Union of Graphs
p. 181-194
Deficiency and Forbidden Subgraphs of Connected, Locally-Connected Graphs
p. 195-208
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination
p. 209-225
More on the Minimum Size of Graphs with Given Rainbow Index
p. 227-241
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
p. 243-253
Roman {2}-Bondage Number of a Graph
p. 255-268
Longer Cycles in Essentially 4-Connected Planar Graphs
p. 269-277
Niche Hypergraphs of Products of Digraphs
p. 279-295
Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
p. 297-305
Strong Geodetic Problem in Networks
p. 307-321
An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
p. 323-329
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
p. 331-344
Incidence Coloring—Cold Cases
p. 345-354
A Short Proof for a Lower Bound on the Zero Forcing Number
p. 355-360

Sommaire du Fascicule no. 2

Slobodan Simić: An Appreciation
p. 367-378
Graphs with All But Two Eigenvalues In [−2, 0]
p. 379-391
Signed Complete Graphs with Maximum Index
p. 393-403
On Regular Signed Graphs with Three Eigenvalues
p. 405-416
Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs
p. 417-433
On the Displacement of Eigenvalues When Removing a Twin Vertex
p. 435-450
Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications
p. 451-466
Some Observations on the Smallest Adjacency Eigenvalue of a Graph
p. 467-493
On the Distance Spectral Radius of Trees with Given Degree Sequence
p. 495-524
The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem
p. 525-532
Existence of Regular Nut Graphs for Degree at Most 11
p. 533-557
On the α-Spectral Radius of Uniform Hypergraphs
p. 559-575
Cospectral Pairs of Regular Graphs with Different Connectivity
p. 577-584
Fractional Revival of Threshold Graphs Under Laplacian Dynamics
p. 585-600
Turán’s Theorem Implies Stanley’s Bound
p. 601-605
Determining Graphs by the Complementary Spectrum
p. 607-620
On Trees as Star Complements in Regular Graphs
p. 621-636
A Few Examples and Counterexamples in Spectral Graph Theory
p. 637-662
A Spectral Characterization of the S-Clique Extension of the Triangular Graphs
p. 663-676
Graphs Whose Aα-Spectral Radius Does Not Exceed 2
p. 677-690

Sommaire du Fascicule no. 3

Power Domination in the Generalized Petersen Graphs
p. 695-712
2-Spanning Cyclability Problems of Some Generalized Petersen Graphs
p. 713-731
Total Forcing Sets and Zero Forcing Sets in Trees
p. 733-754
On Some Properties of Antipodal Partial Cubes
p. 755-770
Extremal Graphs for a Bound on the Roman Domination Number
p. 771-785
On Factorable Bigraphic Pairs
p. 787-793
Regular Colorings in Regular Graphs
p. 795-806
The Edit Distance Function of Some Graphs
p. 807-821
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
p. 823-839
Equating κ Maximum Degrees in Graphs without Short Cycles
p. 841-853
Additive List Coloring of Planar Graphs with Given Girth
p. 855-873
Trees with Distinguishing Index Equal Distinguishing Number Plus One
p. 875-884
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
p. 885-891
Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common
p. 893-917

Sommaire du Fascicule no. 4

A Survey on Packing Colorings
p. 923-970
Super Edge-Connectivity and Zeroth-Order Randić Index
p. 971-984
Light Minor 5-Stars in 3-Polytopes with Minimum Degree 5 and No 6-Vertices
p. 985-994
The Double Roman Domatic Number of a Digraph
p. 995-1004
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
p. 1005-1024
Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9
p. 1025-1033
Connected Domination Critical Graphs with Cut Vertices
p. 1035-1055
Strong Tutte Type Conditions and Factors of Graphs
p. 1057-1065
Congruences and Hoehnke Radicals on Graphs
p. 1067-1084
A Note on the Fair Domination Number in Outerplanar Graphs
p. 1085-1093
The Hanoi Graph $H_4^3$
p. 1095-1109
Comparing Eccentricity-Based Graph Invariants
p. 1111-1125
A Note on the Crossing Numbers of 5-Regular Graphs
p. 1127-1140
Eccentricity of Networks with Structural Constraints
p. 1141-1162
Graph Classes Generated by Mycielskians
p. 1163-1173
On a Total Version of 1-2-3 Conjecture
p. 1175-1186