Geodesic

Tome 40 (2020) no. 1

Sommaire

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