Results 51 to 60 of about 5,793,190 (230)
From Italian domination in lexicographic product graphs to w-domination in graphs [PDF]
Ars Math. Contemp., 2020 In this paper, we show that the Italian domination number of every lexicographic product graph $G\circ H$ can be expressed in terms of five different domination parameters of $G$.
Abel Cabrera Martínez +2 more
semanticscholar +1 more source
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
Mathematics, 2019 Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools
Feng Feng +4 more
doaj +1 more source
Rainbow connection number of generalized composition
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +1 more source
Non-1-Planarity of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +1 more source
Secure Inverse Domination in the Corona and Lexicographic Product of Two Graphs
International Journal For Multidisciplinary ResearchAs secure domination and inverse domination garnered attention from various researchers, the combination of the two also raised a certain amount of curiosity.
Jesica P. Dagodog +4 more
semanticscholar +1 more source
Weakened Gallai-Ramsey numbers [PDF]
Surveys in Mathematics and its Applications, 2018 In the Ramsey theory of graphs, one seeks to determine the value of the Ramsey number rt(n), defined to be the least natural number p such that every coloring of the edges of Kp using t colors results in a monochromatic copy of Kn in some color.
Gabrielle Beam, Mark Budden
doaj
New concepts on level graphs of vague graphs with application in medicine
Frontiers in Physics, 2023 Vague graphs (VGs), belonging to the fuzzy graph (FG) family, have good capabilities when facing problems that cannot be expressed by FGs. When an element membership is unclear, neutrality is a good option that can be well-supported by a VG. The previous
Xiaolong Shi +3 more
doaj +1 more source
IEEE Access, 2018 Fuzzy relation inequalities composed by the min-product operation are established to model the pricing relation in a supply chain system. Basic properties of the min-product fuzzy relation inequalities are presented first, based on which the complete ...
Xuegang Zhou +4 more
doaj +1 more source
Broadcast domination of lexicographic and modular products of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A dominating broadcast labeling of a graph G is a function [Formula: see text] such that [Formula: see text] for all [Formula: see text] where e(v) is the eccentricity of v, and for every vertex [Formula: see text] there exists a vertex v with [Formula ...
Jishnu Sen, Srinivasa Rao Kola
doaj +1 more source
Disjoint Perfect Secure Domination in the Cartesian Product and Lexicographic Product of Graphs
International Journal For Multidisciplinary ResearchLet G be a graph. A dominating set D⊆V(G) is called a secure dominating set of G if for each vertex u∈V(G)∖D, there exists a vertex v∈D such that uv∈ E(G) and the set (D∖{v})∪{u} is a dominating set of G.
Renelyn B. Udtohan +4 more
semanticscholar +1 more source