Geodesic

Sommaire du Fascicule no. 1

The Super-Connectivity of Kneser Graphs
p. 5-11
A Note on Roman Domination of Digraphs
p. 13-21
The Bipartite-Splittance of a Bipartite Graph
p. 23-29
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
p. 31-40
Some Progress on the Double Roman Domination in Graphs
p. 41-53
An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs
p. 55-65
Bounds on the Signed Roman k-Domination Number of a Digraph
p. 67-79
Facial Incidence Colorings of Embedded Multigraphs
p. 81-93
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
p. 95-116
Hamilton Cycles in Double Generalized Petersen Graphs
p. 117-123
New Formulae for the Decycling Number of Graphs
p. 125-141
L(2, 1)-Labeling of Circulant Graphs
p. 143-155
Gaps in the Saturation Spectrum of Trees
p. 157-170
On the Hamiltonian Number of a Plane Graph
p. 171-181
Independence Number, Connectivity and All Fractional (a, b, k)-Critical Graphs
p. 183-190
Oriented Incidence Colourings of Digraphs
p. 191-210
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
p. 211-223
Almost Injective Colorings
p. 225-239
Decomposition of the Product of Cycles Based on Degree Partition
p. 241-256
Pair L(2, 1)-Labelings of Infinite Graphs
p. 257-269
Antipodal Edge-Colorings of Hypercubes
p. 271-284
Anti-Ramsey Number of Hanoi Graphs
p. 285-296

Sommaire du Fascicule no. 2

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
p. 301-312
On the b -Domatic Number of Graphs
p. 313-324
Global Dominator Coloring of Graphs
p. 325-339
Error-Correcting Codes from k -Resolving Sets
p. 341-355
Edge-Connectivity and Edges of Even Factors of Graphs
p. 357-364
Strongly Unichord-Free Graphs
p. 365-374
On Graphs Representable by Pattern-Avoiding Words
p. 375-389
On 3-Colorings of Direct Products of Graphs
p. 391-413
Arankings of Trees
p. 415-437
On Some Characterizations of Antipodal Partial Cubes
p. 439-453
On The Co-Roman Domination in Graphs
p. 455-472
More Results on The Smallest One-Realization of A Given Set II
p. 473-487
Fair Domination Number in Cactus Graphs
p. 489-503
The Product Connectivity Banhatti Index of a Graph
p. 505-517
On The Total Roman Domination in Trees
p. 519-532
Orientable $ \mathbb{Z}_N $-Distance Magic Graphs
p. 533-546
The Crossing Number of The Hexagonal Graph H3,n
p. 547-554
The Second Neighbourhood for Bipartite Tournaments
p. 555-565
Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
p. 567-573
1-Restricted Optimal Rubbling on Graphs
p. 575-588
2-Distance Colorings of Integer Distance Graphs
p. 589-603
Minimum Edge Cuts in Diameter 2 Graphs
p. 605-608

Sommaire du Fascicule no. 3

On Accurate Domination in Graphs
p. 615-627
Facial [r,s,t]-Colorings of Plane Graphs
p. 629-645
A Note on Lower Bounds for Induced Ramsey Numbers
p. 647-654
On Selkow’s Bound on the Independence Number of Graphs
p. 655-657
Graphs With Large Semipaired Domination Number
p. 659-671
Hamiltonicities of Double Domination Critical and Stable Claw-Free Graphs
p. 673-687
Generalized Sum List Colorings of Graphs
p. 689-703
On Radio Connection Number of Graphs
p. 705-730
Hamiltonian Normal Cayley Graphs
p. 731-740
Convex and Weakly Convex Domination in Prism Graphs
p. 741-755
On the Restricted Size Ramsey Number Involving a Path P3
p. 757-769

Sommaire du Fascicule no. 4

Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
p. 775-785
Total Roman Reinforcement in Graphs
p. 787-803
The Turań Number of 2P7
p. 805-814
On Decomposing the Complete Symmetric Digraph into Orientations of K4 − e
p. 815-828
Domination Subdivision and Domination Multisubdivision Numbers of Graphs
p. 829-839
On Independent Domination in Planar Cubic Graphs
p. 841-853
About (k, l)-Kernels, Semikernels and Grundy Functions in Partial Line Digraphs
p. 855-856
Pancyclicity When Each Cycle Contains k Chords
p. 867-879
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
p. 881-888
Facial Rainbow Coloring of Plane Graphs
p. 889-897
Star Coloring Outerplanar Bipartite Graphs
p. 899-908
The Path-Pairability Number of Product of Stars
p. 909-924
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
p. 925-937
A Note on Upper Bounds for Some Generalized Folkman Numbers
p. 939-950
Spectral Radius and Hamiltonicity of Graphs
p. 951-974