Results 51 to 60 of about 3,558 (256)
E-cordial Labeling for Cartesian Product of Some Graphs [PDF]
, 2011 We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Vaidya, S. K., Vyas, N. B.
core +2 more sources
The Crossing Numbers of Products of Path with Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj +1 more source
Distance antimagic labelings of Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho +2 more
doaj +1 more source
A New Framework to Approach Vizing’s Conjecture
Discussiones Mathematicae Graph Theory, 2021 We introduce a new setting for dealing with the problem of the domination number of the Cartesian product of graphs related to Vizing’s conjecture. The new framework unifies two different approaches to the conjecture.
Brešar Boštjan +4 more
doaj +1 more source
Distinguishing Cartesian products of countable graphs
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehsan Estaji +4 more
openaire +2 more sources
Zip product of graphs and crossing numbers [PDF]
, 2020 D. Bokal proved that the crossing number is additive for the zip product under the condition of having two coherent bundles in the zipped graphs. This property is very effective when dealing with the crossing numbers of (capped) Cartesian product of ...
Dong, F. M. +7 more
core +1 more source
Strong perfectness of the generalized Cartesian product of graphs [PDF]
, 1997 In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect.
Szelecka, Alina +3 more
core +1 more source
Isoperimetric Inequalities for Cartesian Products of Graphs [PDF]
Combinatorics, Probability and Computing, 1998 The authors define another number (isoperimetric invariant) describing the bisection behavior of graphs with weights on vertices and edges, which specializes to Mohar's isoperimetric number and to the Cheeger constant for some choices of weights. They prove an alternative characterization of this number which replaces the minimum over the bisections of
Fan R. K. Chung, Prasad Tetali
openaire +2 more sources
Game chromatic number of Cartesian and corona product graphs [PDF]
, 2018 The game chromatic number $\chi_g$ is investigated for Cartesian product $G\square H$ and corona product $G\circ H$ of two graphs $G$ and $H$. The exact values for the game chromatic number of Cartesian product graph of $S_{3}\square S_{n}$ is found ...
Syed Ahtsham Ul Haq BOKHARY +5 more
core +2 more sources
Super Fair Dominating Set in the Cartesian Product of Graphs [PDF]
, 2020 In this paper, we characterize the super fair dominating set in the Cartesian product of two graphs and give some important ...
Enrico L. Enriquez, Glenna T. Gemina
core +1 more source