The binding number of product graphs

1984 ◽  
pp. 119-128 ◽  
Author(s):  
Wang Jianfang ◽  
Tian Songlin ◽  
Liu Jiuqiang
Keyword(s):  
Binding Number ◽  
Product Graphs

rr-SEQUENCE PRODUCT GRAPHS

2020 ◽  
Vol 9 (3) ◽  
pp. 927-936
Author(s):  
S. Avadayappan ◽  
M. Bhuvaneshwari ◽  
S. Vimalajenifer
Keyword(s):  
Product Graphs

T-Coloring of Product Graphs

2021 ◽  
Author(s):  
S. Jai Roselin ◽  
L. Benedict Michael Raj
Keyword(s):  
Product Graphs

scholarly journals A new class of antimagic Cartesian product graphs

2008 ◽  
Vol 308 (24) ◽  
pp. 6441-6448 ◽  
Author(s):  
Yongxi Cheng
Keyword(s):  
Cartesian Product ◽  
New Class ◽  
Product Graphs ◽  
Cartesian Product Graphs

scholarly journals Regular embeddings of Cartesian product graphs

2012 ◽  
Vol 312 (2) ◽  
pp. 258-264
Author(s):  
Jun-Yang Zhang
Keyword(s):  
Cartesian Product ◽  
Product Graphs ◽  
Cartesian Product Graphs

scholarly journals Some Domination Parameters of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

2012 ◽  
Vol 58 (9) ◽  
pp. 32-38
Author(s):  
S. UmaMaheswari ◽  
B. Maheswari ◽  
M. Manjuri
Keyword(s):  
Direct Product ◽  
Cayley Graphs ◽  
Product Graphs

scholarly journals Chromatic Number for a Generalization of Cartesian Product Graphs

10.37236/160 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Daniel Král' ◽  
Douglas B. West
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Cartesian Product ◽  
Rectangular Grid ◽  
Product Graphs ◽  
Cartesian Product Graphs

Let ${\cal G}$ be a class of graphs. A $d$-fold grid over ${\cal G}$ is a graph obtained from a $d$-dimensional rectangular grid of vertices by placing a graph from ${\cal G}$ on each of the lines parallel to one of the axes. Thus each vertex belongs to $d$ of these subgraphs. The class of $d$-fold grids over ${\cal G}$ is denoted by ${\cal G}^d$. Let $f({\cal G};d)=\max_{G\in{\cal G}^d}\chi(G)$. If each graph in ${\cal G}$ is $k$-colorable, then $f({\cal G};d)\le k^d$. We show that this bound is best possible by proving that $f({\cal G};d)=k^d$ when ${\cal G}$ is the class of all $k$-colorable graphs. We also show that $f({\cal G};d)\ge{\left\lfloor\sqrt{{d\over 6\log d}}\right\rfloor}$ when ${\cal G}$ is the class of graphs with at most one edge, and $f({\cal G};d)\ge {\left\lfloor{d\over 6\log d}\right\rfloor}$ when ${\cal G}$ is the class of graphs with maximum degree $1$.

scholarly journals The metric dimension of strong product graphs

2015 ◽  
Vol 31 (2) ◽  
pp. 261-268
Author(s):  
JUAN A. RODRIGUEZ-VELAZQUEZ ◽  
◽  
DOROTA KUZIAK ◽  
ISMAEL G. YERO ◽  
JOSE M. SIGARRETA ◽  
...  
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Np Hard ◽  
Strong Product ◽  
Product Graphs ◽  
Metric Basis

For an ordered subset S = {s1, s2, . . . sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1), dG(v, s2), . . . , dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y. The set S is a metric generator for G if every two different vertices of G have distinct metric representations with respect to S. A minimum metric generator is called a metric basis for G and its cardinality, dim(G), the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-Hard. In this paper we obtain closed formulae and tight bounds for the metric dimension of strong product graphs.

Sign in / Sign up

Export Citation Format

Share Document