Results 61 to 70 of about 5,134,655 (243)
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
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
Secure Inverse Domination in the Corona and Lexicographic Product of Two Graphs
As 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
Hamiltonian decomposition of lexicographic product
AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28): If two graphs are decomposable into Hamiltonian cycles, then their lexicographic product is decomposable, too.
Baranyai, Z, Szász, Gy.R
openaire +2 more sources
Weakened Gallai-Ramsey numbers [PDF]
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
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
Abstract This study investigates the lexicographical potential of Medieval Latin documentation from the Venetian area of the Italo‐Romance domain, highlighting the need for a systematic approach to bridge Latin and vernacular linguistic developments. The project MEDITA – Medieval Latin Documentation and Digital Italo‐Romance Lexicography.
Jacopo Gesiot
wiley +1 more source
On the weak Roman domination number of lexicographic product graphs
A vertex $v$ of a graph $G=(V,E)$ is said to be undefended with respect to a function $f: V \longrightarrow \{0,1,2\}$ if $f(v)=0$ and $f(u)=0$ for every vertex $u$ adjacent to $v$.
Pérez-Rosés, Hebert +2 more
core +1 more source
Rainbow connection number of generalized composition
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
Outer-restrained Domination in the Lexicographic Product of Two Graphs
Let G be a connected simple graph. A set S⊆V(G) is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in (G)∖S .
Celart A. Tuble +4 more
semanticscholar +1 more source
Is there really a dictator's dilemma? Information and repression in autocracy
Abstract In his seminal work on the political economy of dictatorship, Ronald Wintrobe posited the existence of a “dictator's dilemma,” in which repression leaves an autocrat less secure by reducing information about discontent. We explore the nature and resolution of this dilemma with a formalization that builds on recent work in the political economy
Scott Gehlbach +3 more
wiley +1 more source

