Cyclic vertex-connectivity of Cartesian product graphs
D Qin, Y Tian, L Chen, J Meng - International Journal of Parallel …, 2020 - Taylor & Francis
A cyclic vertex-cut of a graph G is a vertex set S such that G− S is disconnected and at least
two of its components contain cycles. If G has a cyclic vertex-cut, then it is said to be …
two of its components contain cycles. If G has a cyclic vertex-cut, then it is said to be …
The outer-connected vertex edge domination number in Cartesian product graphs
Let G be a simple, finite and connected graph. An outer-connected vertex edge dominating
set, abbreviated OCVEDS of G is a subset D of vertices of G such that D is a vertex edge …
set, abbreviated OCVEDS of G is a subset D of vertices of G such that D is a vertex edge …
[PDF][PDF] Motion planning in certain lexicographic product graphs
Let G be an undirected graph with n vertices in which a robot is placed at a vertex say v, and
a hole at vertex u and in all other (n− 2) vertices are obstacles. We refer to this assignment of …
a hole at vertex u and in all other (n− 2) vertices are obstacles. We refer to this assignment of …
[BOOK][B] MATHEMATICAL COMBINATORICS, Vol. 4/2018: INTERNATIONAL BOOK SERIES
L Mao - 2018 - books.google.com
The Mathematical Combinatorics (International Book Series) is a fully refereed international
book series with ISBN number on each issue, sponsored by the MADIS of Chinese Academy …
book series with ISBN number on each issue, sponsored by the MADIS of Chinese Academy …
On 1RJ Moves in Cartesian Product Graphs
Let G be an undirected graph with n vertices in which a robot is placed at a vertex say v, and
a hole at vertex u and in all other (n− 2) vertices are obstacles. We refer to this assignment of …
a hole at vertex u and in all other (n− 2) vertices are obstacles. We refer to this assignment of …