Results 11 to 20 of about 26,105 (190)
Double domination in lexicographic product graphs [PDF]
Discrete Applied Mathematics, 2020 In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating sets of $G$ is the double domination number.
Abel Cabrera Martínez +2 more
openaire +8 more sources
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 +3 more sources
Leveraging Co-Occurrence to Improve Deep Learning Photo-Identification in Social Animals. [PDF]
Ecol EvolPhoto‐identification of social animals is traditionally manual and time‐intensive, and most deep learning approaches ignore the structured, encounter‐based way in which individuals are observed. We introduce a lightweight, model‐agnostic fusion method that combines image‐level classifier probabilities with global sighting priors and historical co ...
Barnhill A +7 more
europepmc +2 more sources
Operations on Neutrosophic Vague Soft Graphs [PDF]
Neutrosophic Sets and Systems, 2022 This article concerns with the neutrosophic vague soft graphs for treating neutrosophic vague soft information by employing the theory of neutrosophic vague soft sets with graphs.
S. Satham Hussain +3 more
doaj +1 more source
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
Functorial equations for lexicographic products [PDF]
Proceedings of the American Mathematical Society, 2003 Summary: We generalize the main result of an earlier paper by the authors [Proc. Am. Math. Soc. 125, 3177-3183 (1997; Zbl 0888.12004)] concerning the convex embeddings of a chain \(\Gamma\) in a lexicographic power \(\Delta^{\Gamma}\). For a fixed non-empty chain \(\Delta\), we derive necessary and sufficient conditions for the existence of non-empty ...
Kuhlmann, Franz-Viktor +2 more
openaire +3 more sources
Metric dimension of lexicographic product of some known graphs [PDF]
Journal of Mahani Mathematical Research, 2023 For an ordered set $W=\{w_1,w_2,\ldots,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),\ldots,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y ...
Mohsen Jannesari
doaj +1 more source
The generalized 3-connectivity of Lexicographic product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xueliang Li, Yaping Mao
doaj +1 more source
Lexicographic palindromic products
The Art of Discrete and Applied Mathematics, 2022 Summary: A graph \(G\) on \(n\) vertices is \textit{palindromic} if there is a vertex-labeling bijection \(f : V(G) \rightarrow \{1, 2, \dots, n\}\) with the property that for any edge \(vw \in E(G)\), there is an edge \(xy \in E(G)\) for which \(f(x) = n - f(v) + 1\) and \(f(y) = n - f(w) + 1\).
openaire +2 more sources
Quadripartitioned Neutrosophic Graph Structures [PDF]
Neutrosophic Sets and Systems, 2022 The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part.
S. Satham Hussain +5 more
doaj +1 more source