Results 51 to 60 of about 87,870 (251)
A SURVEY INTUITIONISTIC FUZZY GRAPH [PDF]
I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [5] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area. The first definition
Iuliana Carmen BĂRBĂCIORU +1 more
doaj
Isomorphism identification is an essential step in the structure synthesis of Kinematic Chain (KC), and needs a large amount of analysis and calculation.
Liangbo Sun +5 more
doaj +1 more source
Advanced Datapath Synthesis using Graph Isomorphism
This paper presents an advanced DAG-based algorithm for datapath synthesis that targets area minimization using logic-level resource sharing. The problem of identifying common specification logic is formulated using unweighted graph isomorphism problem ...
Choudhury, Mihir +3 more
core +1 more source
Graph Isomorphism Restricted by Lists [PDF]
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs $G$ and $H$, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each $u \in V(G)$, we are given a list ${\mathfrak L}(u ...
Klavík, Pavel +2 more
openaire +2 more sources
Formation of Condition‐Dependent Alpha‐Synuclein Fibril Strain in Artificial Cerebrospinal Fluid
α‐synuclein aggregation in artificial cerebrospinal fluid (aCSF) leads to a distinct conformation with an electron density pocket motif found in aggregates from PD and MSA patients. Such fibrils has low stability outside the reaction conditions, hinting about the influence of cerebrospinal fluid components not only on the formation, but also on the ...
Rūta Sniečkutė +7 more
wiley +1 more source
Old and new generalizations of line graphs
Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj +1 more source
Groups for which the noncommuting graph is a split graph [PDF]
The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of
Marzieh Akbari, Alireza Moghaddamfar
doaj +1 more source
A quantum-walk-inspired adiabatic algorithm for graph isomorphism
We present a 2-local quantum algorithm for graph isomorphism GI based on an adiabatic protocol. By exploiting continuous-time quantum-walks, we are able to avoid a mere diffusion over all possible configurations and to significantly reduce the ...
Tamascelli, Dario, Zanetti, Luca
core +1 more source
Microbial synthesis of nanomaterials (NMs) is eco‐friendly, but the screening of microorganisms is limited by inefficient traditional methods (currently only involving∽400 microorganisms/90 NMs). We propose AI framework MicrobeDiscover, integrating a knowledge graph of microbe‐NM interactions.
Ludi Wang +12 more
wiley +1 more source
Planar Graphs under Pythagorean Fuzzy Environment
Graph theory plays a substantial role in structuring and designing many problems. A number of structural designs with crossings can be found in real world scenarios. To model the vagueness and uncertainty in graphical network problems, many extensions of
Muhammad Akram +2 more
doaj +1 more source

