Results 51 to 60 of about 13,469,908 (217)
New secure distributed secret sharing scheme of n product
Tongxin xuebao, 2014 Since Shamir’s secret sharing scheme does not have the property of the multiplicative homomorphism，an encoding method is utilized for privacy-preserving data to overcome the drawbacks in secure distributed multiplication calculation when using ...
Zhen-hua CHEN +4 more
doaj +2 more sources
Sahand Communications in Mathematical Analysis, 2016 In this article, the notion of $n-$derivation is introduced for all integers $ngeq 2$. Although all derivations are $n-$derivations, in general these notions are not equivalent.
Mohammad Hossein Sattari
doaj
Explicit 3‐colorings for Exponential Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
Line Graphs of Multigraphs and the Forbidden Graph E 6
Journal of Graph Theory, EarlyView.ABSTRACT The line graph Γ of a multigraph Δ is the graph whose vertices are the edges of Δ, where two such edges are adjacent if and only if they meet in a single vertex of Δ. We provide several characterizations of such line graphs and in particular show that a graph is a line graph if and only if it does not contain one of the 32 graphs, all of which
Hans Cuypers
wiley +1 more source
On Sparsity Conditions Guaranteeing a Fractional Coloring
Journal of Graph Theory, EarlyView.ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley +1 more source
Result for the group SL(2,172)
Ibn Al-Haitham Journal for Pure and Applied SciencesThe set of all (n×n) non-singular matrices over the field F this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension n over the field F, denoted by GL(n,F).
Ghofran Awad Khalaf +3 more
doaj +1 more source
On The Two-Fold Fuzzy n-Refined Neutrosophic Rings For 2≤n≤3 [PDF]
Neutrosophic Sets and SystemsThe objective of this paper is to study the two-fold fuzzy algebra based on n-refined neutrosophic rings for some different special values of n, where we study some of the special elements in the case of two-fold 2-refined neutrosophic ring and 3-refined
Abdallah Shihadeh +4 more
doaj +1 more source
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
On Fully (m,n)-stable modules relative to an ideal A of
مجلة بغداد للعلوم, 2015 Let R be a commutative ring with non-zero identity element. For two fixed positive integers m and n. A right R-module M is called fully (m,n) -stable relative to ideal A of , if for each n-generated submodule of Mm and R-homomorphism .
Baghdad Science Journal
doaj +1 more source