Results 31 to 40 of about 6,219 (246)
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
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +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
Investigations in Quantum Computing: Causality and Graph Isomorphism [PDF]
, 2004 In this thesis I explore two different types of limits on the time complexity of quantum computation---that is, limits on how much time is required to perform a given class of quantum operations on a quantum system. Upper limits can be found by explicit
Beckman, David Eugene
core +1 more source
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
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +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
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
Group nilpotency from a graph point of view [PDF]
International Journal of Group Theory, 2023 Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$. In the present
Valentina Grazian +2 more
doaj +1 more source