Results 41 to 50 of about 3,577 (286)
Convex domination in the composition and Cartesian product of graphs [PDF]
, 2012 summary:In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a graph are defined.
Labendia, Mhelmar A. +1 more
core +1 more source
k-Forcing number for Cartesian product of some graphs
, 2021 $k$-Forcing is an iterative graph coloring process based on a color change rule that describes how to color the vertices. $k$-Forcing is a generalization of zero forcing that is useful in multiple scientific branches, such as quantum control.
Soltankhah, Nasrin, Montazeri, Zeinab
core +1 more source
The profile of the Cartesian product of graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Kuo, Jing-Ho Yan
openaire +2 more sources
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
, 2022 A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index.
Tuza, Zsolt +3 more
core +1 more source
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
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
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
Cartesian product of two picture fuzzy hypersoft graphs.
, 2023 Cartesian product of two picture fuzzy hypersoft graphs.
Ibrahim Mekawy (14755646) +3 more
core +1 more source