Results 31 to 40 of about 544,762 (274)
NZ‐flows in strong products of graphs
Journal of Graph Theory, 2010 AbstractWe prove that the strong product G1⊠ G2 of G1 and G2 is ℤ3‐flow contractible if and only if G1⊠ G2 is not T⊠ K2, where T is a tree (we call T⊠ K2 a K4‐tree). It follows that G1⊠ G2 admits an NZ 3 ‐flow unless G1⊠ G2 is a K4 ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G1⊠ G2 is not ...
Imrich, Wilfried +3 more
openaire +3 more sources
Theory and Applications of Fermatean Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2022 Yager et. al. defined a q-rung orthopair fuzzy sets as a new general class of Pythagorean fuzzy set in which the sum of the qth power of the support for and support against is bonded by one. Tapan et. al. extended the concept of intuitionistic fuzzy sets
Said Broumi +4 more
doaj +1 more source
Erratum to “On the strong metric dimension of the strong products of graphs”
Open Mathematics, 2015 The original version of the article was published in Open Mathematics (formerly Central European Journal of Mathematics) 13 (2015) 64–74. Unfortunately, the original version of this article contains a mistake: in Lemma 2.17 appears that for any C1-graph ...
Kuziak Dorota +2 more
doaj +1 more source
On global (strong) defensive alliances in some product graphs
Communications in Combinatorics and Optimization, 2017 A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The
Ismael Gonz\'alez Yero +2 more
doaj +1 more source
A Novel Study of Graphs Based on m-Polar Cubic Structures
Journal of Function Spaces, 2022 By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin +4 more
doaj +1 more source
On average connectivity of the strong product of graphs [PDF]
, 2013 The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices.
Abajo Casado, María Encarnación +3 more
core +1 more source
Bounds for the pebbling number of product graphs [PDF]
Transactions on Combinatorics, 2022 Let $G$ be a connected graph. Given a configuration of a fixed number of pebbles on the vertex set of $G$, a pebbling move on $G$ is the process of removing two pebbles from a vertex and adding one pebble on an adjacent vertex. The pebbling number of $G$,
Nopparat Pleanmani +2 more
doaj +1 more source
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs [PDF]
, 2018 A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what ...
Bondy J. A. +6 more
core +3 more sources
Strong geodetic cores and Cartesian product graphs [PDF]
Applied Mathematics and Computation, 2019 19 pages, 4 ...
Valentin Gledel +2 more
openaire +2 more sources
Weak reconstruction of strong product graphs
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zmazek, Blaž, Žerovnik, Janez
openaire +2 more sources