Geodesic

Sommaire du Fascicule no. 1

Upper Bounds for the Strong Chromatic Index of Halin Graphs
p. 5-26
A Characterization for 2-Self-Centered Graphs
p. 27-37
A Note on the Interval Function of a Disconnected Graph
p. 39-48
Bounds on the Locating Roman Domination Number in Trees
p. 49-62
Power Domination in Knödel Graphs and Hanoi Graphs
p. 63-74
Cubic Graphs with Total Domatic Number at Least Two
p. 75-82
Inverse Problem on the Steiner Wiener Index
p. 83-95
Constant Sum Partition of Sets of Integers and Distance Magic Graphs
p. 97-106
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
p. 107-119
Fibonacci and Telephone Numbers in Extremal Trees
p. 121-133
The Distance Magic Index of a Graph
p. 135-142
Rainbow Vertex-Connection and Forbidden Subgraphs
p. 143-154
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
p. 155-163
Cores, Joins and the Fano-Flow Conjectures
p. 165-175
On the Number of α-Labeled Graphs
p. 177-188
Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph
p. 189-201
Domination Parameters of a Graph and its Complement
p. 203-215
Matchings Extend to Hamiltonian Cycles in 5-Cube
p. 217-231
The Graphs Whose Permanental Polynomials Are Symmetric
p. 233-243
On Two Generalized Connectivities of Graphs
p. 245-261
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
p. 263-273
Hereditary Equality of Domination and Exponential Domination
p. 275-285
Bounding the Open k-Monopoly Number of Strong Product Graphs
p. 287-299
On the Total k-Domination in Graphs
p. 301-317

Sommaire du Fascicule no. 2

\( \mathcal{P} \)-Apex Graphs
p. 323-349
The Crossing Number of Join of the Generalized Petersen Graph P (3, 1) with Path and Cycle
p. 351-370
Generalized Rainbow Connection of Graphs and their Complements
p. 371-384
The Complexity of Secure Domination Problem in Graphs
p. 385-396
A Note on the Ramsey Number of Even Wheels Versus Stars
p. 397-404
A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs
p. 405-427
The Minimum Harmonic Index for Unicyclic Graphs with Given Diameter
p. 429-442
More About the Height of Faces in 3-Polytopes
p. 443-453
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
p. 455-462
On the Palette Index of Complete Bipartite Graphs
p. 463-476
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
p. 477-490
On the Number of Disjoint 4-Cycles in Regular Tournaments
p. 491-498
The Smallest Harmonic Index of Trees with Given Maximum Degree
p. 499-513
Some Results on the Independence Polynomial of Unicyclic Graphs
p. 515-524
Irreducible No-Hole L(2, 1)-Coloring of Edge-Multiplicity-Paths-Replacement Graph
p. 525-552
Homomorphic Preimages of Geometric Paths
p. 553-571
Total Domination Versus Paired-Domination in Regular Graphs
p. 573-586
Another View of Bipartite Ramsey Numbers
p. 587-605
Almost Self-Complementary Uniform Hypergraphs
p. 607-610

Sommaire du Fascicule no. 3

Describing Neighborhoods of 5-Vertices in 3-Polytopes with Minimum Degree 5 and Without Vertices of Degrees from 7 to 11
p. 615-625
Generalized Hamming Graphs: Some New Results
p. 627-633
A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
p. 635-643
On Independent [1, 2]-Sets in Trees
p. 645-660
Hamiltonian and Pancyclic Graphs in the Class of Self-Centered Graphs with Radius Two
p. 661-681
On the Beta-Number of Forests with Isomorphic Components
p. 683-701
Reconfiguring Minimum Dominating Sets: The γ-Graph of a Tree
p. 703-716
Turán Function and H-Decomposition Problem for Gem Graphs
p. 717-741
The {−2,−1}-Selfdual and Decomposable Tournaments
p. 743-789
Extremal Irregular Digraphs
p. 791-800
Completely Independent Spanning Trees in k-th Power of Graphs
p. 801-810
Trees with Unique Least Central Subtrees
p. 811-828
Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree
p. 829-839
Perturbations in a Signed Graph and its Index
p. 841-852
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
p. 853-865

Sommaire du Fascicule no. 4

Tr -Span of Directed Wheel Graphs
p. 871-888
Graphic and Cographic Г-Extensions of Binary Matroids
p. 889-898
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
p. 899-909
Conflict-Free Connections of Graphs
p. 911-920
The Largest Component in Critical Random Intersection Graphs
p. 921-946
Making a Dominating Set of a Graph Connected
p. 947-962
On Total Domination in the Cartesian Product of Graphs
p. 963-976
Total Colorings of Embedded Graphs with No 3-Cycles Adjacent to 4-Cycles
p. 977-989
Eternal m-Security Bondage Numbers in Graphs
p. 991-1006
Rainbow Disconnection in Graphs
p. 1007-1021
Rainbow Total-Coloring of Complementary Graphs and Erdős-Gallai Type Problem For The Rainbow Total-Connection Number
p. 1023-1036
List Star Edge-Coloring of Subcubic Graphs
p. 1037-1054