Results 41 to 50 of about 549,593 (301)
Some Applications of Strong Product [PDF]
Mathematics Interdisciplinary Research, 2018 Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent ...
Mostafa Tavakoli +2 more
doaj +1 more source
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
(Di)graph products, labelings and related results [PDF]
, 2017 Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them.
López Masip, Susana-Clara
core +4 more sources
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
Superconnectivity of Networks Modeled by the Strong Product of Graphs [PDF]
, 2015 Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using graph terminology, we first give a lower bound for the vertex connectivity of the strong product of two networks and then we ...
Cera López, Martín +3 more
core +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
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
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 Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity
Journal of Mathematics, 2022 Let G be a graph with vertex set as VG and edge set as EG which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T⊆VG, which contains no isolated vertices, and all the vertices in VG\T lie on a ...
Eddith Sarah Varghese +5 more
doaj +1 more source