Results 21 to 30 of about 87,870 (251)
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
Graphs isomorphic to their path graphs [PDF]
Mathematica Bohemica, 2002 Summary: We prove that for every number \(n\geq 1\), the \(n\)-iterated \(P_3\)-path graph of \(G\) is isomorphic to \(G\) if and only if \(G\) is a collection of cycles, each of length at least 4. Hence, \(G\) is isomorphic to \(P_3(G)\) if and only if \(G\) is a collection of cycles, each of length at least 4.
Knor, Martin, Niepel, L'udovít
openaire +1 more source
Homomorphic Preimages of Geometric Paths
Discussiones Mathematicae Graph Theory, 2018 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source
Crystal isomorphisms in Fock spaces and Schensted correspondence in affine type A [PDF]
, 2014 We are interested in the structure of the crystal graph of level $l$ Fock spaces representations of $\mathcal{U}_q (\widehat{\mathfrak{sl}_e})$. Since the work of Shan [26], we know that this graph encodes the modular branching rule for a corresponding ...
A Lascoux +19 more
core +3 more sources
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
Foundations of Computing and Decision Sciences, 2016 In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete.
Nagoya Takayuki
doaj +1 more source
Energy landscape structure of small graph isomorphism under variational optimization [PDF]
AIP AdvancesWe investigate a quadratic unconstrained binary optimization formulation of the graph isomorphism problem using the quantum approximate optimization algorithm and the variational quantum eigensolver.
Turbasu Chatterjee +2 more
doaj +1 more source
A Study of Complex Dombi Fuzzy Graph With Application in Decision Making Problems
IEEE Access, 2022 A complex fuzzy set (CFS) is a generalization of a fuzzy set (FS) in which a limit of degrees occurs on the complex plane with unit disc. The averaging operators are a key part of turning all the data into one value.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source
Isomorphic Factorisations. I: Complete Graphs [PDF]
Transactions of the American Mathematical Society, 1978 An isomorphic factorisation of the complete graphKp{K_p}is a partition of the lines ofKp{K_p}intotisomorphic spanning subgraphsG; we then writeG|KpG|{K_p}, andG∈Kp/tG \in {K_p}/t. If the set of graphsKp/t{K_p}/tis not empty, then of courset|p(p−1)/2t|p(p - 1)/2. Our principal purpose is to prove the converse.
Harary, Frank +2 more
openaire +2 more sources
An Optimization of Closed Frequent Subgraph Mining Algorithm
Cybernetics and Information Technologies, 2017 Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability [PDF]
QuantumMančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al.
Prem Nigam Kar +3 more
doaj +1 more source