Results 91 to 100 of about 514 (184)
The Quest for A Characterization of Hom-Properties of Finite Character
Discussiones Mathematicae Graph Theory, 2016 A graph property is a set of (countable) graphs. A homomorphism from a graph G to a graph H is an edge-preserving map from the vertex set of G into the vertex set of H; if such a map exists, we write G → H.
Broere Izak +2 more
doaj +1 more source
FORCING QUASIRANDOMNESS WITH TRIANGLES
Forum of Mathematics, Sigma, 2019 We study forcing pairs for quasirandom graphs. Chung, Graham, and Wilson initiated the study of families ${\mathcal{F}}$ of graphs with the property that if a large graph $G$ has approximately homomorphism density $p^{e(F)}$ for some fixed $p\in (0,1 ...
CHRISTIAN REIHER, MATHIAS SCHACHT
doaj +1 more source
The Submodule-Based Zero-Divisor Graph with Respect to Some Homomorphism
Journal of Mathematical Extension, 2013 Let M be an R-module and 0 6= f ∈ M∗ = Hom(M, R). The graph Γf (M) is a graph with vertices Z f (M) = {x ∈ M \ {0} | xf(y) = 0 or yf(x) = 0 for some non-zero y ∈ M}, in which non-zero elements x and y are adjacent provided that xf(y) = 0 or yf(x ...
M. Baziar, N. Ranjbar
doaj
Circular Economy Strategies to Promote Sustainable Development using t-Neutrosophic Fuzzy graph [PDF]
Neutrosophic Sets and SystemsThis study discusses the use of t-neutrosophic graphs to express and understand complex interactions. It also shows how these graphs might manage intricate relationships with a wide range of variables or scenario elements.
M. Kaviyarasu +6 more
doaj +1 more source
Correspondence Homomorphisms to Reflexive Graphs
Electronic Notes in Discrete Mathematics, 2017 Abstract Correspondence homomorphisms are a common generalization of homomorphisms and of correspondence colourings. For a fixed reflexive target graph H, the problem is to decide whether an input graph G, with each edge labeled by a pair of permutations of V(H), admits a homomorphism to H ‘corresponding’ to the labels.
Tomás Feder, Pavol Hell
openaire +1 more source
The NEPS of Gain Graphs over Arbitrary Groups and its Spectra [PDF]
Advances in Group Theory and ApplicationsWe provide two definitions for a gain function on a non-complete extended p-sum (NEPS) of gain graphs over arbitrary groups. In the first one, the gain function takes values in the direct product of the gain groups of the factors.
Matteo Cavaleri +2 more
doaj +1 more source
Distinguishing homomorphisms of infinite graphs
Contributions to Discrete Mathematics, 2012 We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper n-colourings are generalized to the new notion of distinguishing homomorphisms. We prove that if a graph G satisfies the connected existentially closed property and admits a homomorphism to H, then it admits
Anthony Bonato, Dejan Delic
openaire +2 more sources
On Some Basic Theorems of Continuous Module Homomorphisms between Random Normed Modules
Journal of Function Spaces and Applications, 2013 We first prove the resonance theorem, closed graph theorem, inverse operator theorem, and open mapping theorem for module homomorphisms between random normed modules by simultaneously considering the two kinds of topologies—the -topology and the locally -
Guo Tiexin
doaj +1 more source
Binary relations applied to the fuzzy substructures of quantales under rough environment
Demonstratio MathematicaBinary relations (BIRs) have many applications in computer science, graph theory, and rough set theory. This study discusses the combination of BIRs, fuzzy substructures of quantale, and rough fuzzy sets.
Mazher Qurashi Saqib +4 more
doaj +1 more source
Connected-homomorphism-homogeneous graphs
J. Graph Theory, 2012 A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where "isomorphism" may be replaced by "homomorphism" or "monomorphism" in the definition.
openaire +3 more sources