Results 271 to 280 of about 3,577 (286)

On Cartesian Product of Factor-Critical Graphs

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zefang Wu, Xu Yang, Qinglin Yu
openaire   +1 more source

THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2014
The diameter of a graph can be affected by the addition or deletion of edges. In this paper, we examine the Cartesian product of graphs whose diameter increases (decreases) by the deletion (addition) of a single edge. The problems of minimality and maximality of the Cartesian product of graphs with respect to its diameter are also solved.
M. R. Chithra, Ambat Vijayakumar
openaire   +2 more sources

The Pfaffian property of Cartesian products of graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Fuliang, Zhang, Lianzhu
openaire   +2 more sources

On independence numbers of the Cartesian product of graphs

Ars Comb., 1996
The Cartesian product \(G\square H\) of graphs \(G\), \(H\) is the graph whose vertex set is the Cartesian product \(V(G) \times V(H)\) of the vertex sets of \(G\) and \(H\) and in which two vertices \((a,x)\), \((b,y)\) are adjacent if and only if either \(a=b\) and \(x\), \(y\) are adjacent in \(H,\) or \(a\), \(b\) are adjacent in \(G\) and \(x=y.\)
Johann Hagauer, Sandi Klavzar
openaire   +1 more source

Fast Searching on Cartesian Products of Graphs

2017
Given a graph that contains an invisible fugitive, the fast searching problem is to find the fast search number, i.e., the minimum number of searchers to capture the fugitive in the fast search model. In this paper, we give a new lower bound on the fast search number. Using the new lower bound, we prove an explicit formula for the fast search number of
Yuan Xue, Boting Yang
openaire   +1 more source

Game chromatic number of Cartesian product graphs

Electronic Notes in Discrete Mathematics, 2007
Iztok Peterin
exaly  

Strong resolving partitions for strong product graphs and Cartesian product graphs

Discrete Applied Mathematics, 2016
Ismael G Yero
exaly  

Game coloring the Cartesian product of graphs

Journal of Graph Theory, 2008
Xuding Zhu
exaly  

On the geodetic number and related metric sets in Cartesian product graphs

Discrete Mathematics, 2008
Boštjan Brešar, Sandi Klavžar
exaly  

k-tuple colorings of the Cartesian product of graphs

Discrete Applied Mathematics, 2018
Flavia Bonomo, Ivo Koch, Mario Valencia-Pabon   +2 more
exaly