The matching polynomial of a polygraph
Discrete Applied Mathematics
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
Data structures and algorithm analysis (2nd ed.)
Data structures and algorithm analysis (2nd ed.)
Relating path coverings to vertex labellings with a condition at distance two
Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs
SIAM Journal on Discrete Mathematics
On the size of graphs labeled with condition at distance two
Journal of Graph Theory
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Algebraic approach to fasciagraphs and rotagraphs
Discrete Applied Mathematics
Distance-related invariants on polygraphs
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Improved lower bound on the Shannon capacity of C7
Information Processing Letters
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Graph labeling and radio channel assignment
Journal of Graph Theory
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
L(2, 1)-labeling of strong products of cycles
Information Processing Letters
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
L(2, 1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Distance-two labelings of digraphs
Discrete Applied Mathematics
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs
Discrete Applied Mathematics
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
L(2,1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
L(2,1)-labeling of strong products of cycles
Information Processing Letters
Exact λ-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
Discrete Applied Mathematics
On the L(2,1)-labelings of amalgamations of graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |
Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is proposed and two of its applications are presented. First, the λ-numbers of the Cartesian product of a cycle and a path are computed, where the λ-number of a graph G is the minimum number of colors needed in a (2, 1)-coloring of G. The independence numbers of the family of the strong product graphs C7 × C7 × C2k+1 are also obtained.