Results 1 to 10 of about 514 (184)
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography [PDF]
Using asymmetric topology cryptography to encrypt networks on the basis of topology coding is a new topic of cryptography, which consists of two major elements, i.e., topological structures and mathematical constraints.
Meimei Zhao, Hongyu Wang, Bing Yao
doaj +2 more sources
Entropy, Graph Homomorphisms, and Dissociation Sets [PDF]
Given two graphs G and H, the mapping of f:V(G)→V(H) is called a graph homomorphism from G to H if it maps the adjacent vertices of G to the adjacent vertices of H.
Ziyuan Wang, Jianhua Tu, Rongling Lang
doaj +2 more sources
A graph homomorphism approach for unraveling histories of metastatic cancers and viral outbreaks under evolutionary constraints [PDF]
Viral infections and cancers are driven by evolution of populations of highly mutable genomic variants. A key evolutionary process in these populations is their migration or spread via transmission or metastasis. Understanding this process is crucial for
Kiril Kuzmin +5 more
doaj +2 more sources
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial [PDF]
A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch} at a vertex $v$
Richard C Brewster +2 more
doaj +1 more source
In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj +1 more source
Subgroup Graphs of Finite Groups
Let G be a fnite group with the set of subgroups of G denoted by S(G), then the subgroup graphs of G denoted by T(G) is a graph which set of vertices is S(G) such that two vertices H, K in S(G) (H not equal to K) are adjacent if either H is a subgroup of
Ojonugwa Ejima +2 more
doaj +1 more source
Minimal definable graphs of definable chromatic number at least three
We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we characterize the Borel
Raphaël Carroy +3 more
doaj +1 more source
Neutrosophic Vague Line Graphs [PDF]
Neutrosophic graphs are employed as a mathematical key to hold an imprecise and unspecified data. Vague sets gives more intuitive graphical notation of vague information, that delicates crucially better analysis in data relationships, incompleteness and ...
S. Satham Hussain +2 more
doaj +1 more source
More on linear and metric tree maps [PDF]
We consider linear and metric self-maps on vertex sets of finite combinatorial trees. Linear maps are maps which preserve intervals between pairs of vertices whereas metric maps are maps which do not increase distances between pairs of vertices.
Sergiy Kozerenko
doaj +1 more source
Novel Concepts in Bipolar Fuzzy Graphs with Applications
Many problems of practical interest can be modeled and solved by using bipolar graph algorithms. Bipolar fuzzy graph (BFG), belonging to fuzzy graphs (FGs) family, has good capabilities when facing with problems that cannot be expressed by FGs. Hence, in
Chang Wan +5 more
doaj +1 more source

