Results 71 to 80 of about 87,870 (251)
Graph isomorphism—Characterization and efficient algorithms
The Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete.
Jian Ren, Tongtong Li
doaj +1 more source
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
Mapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
Twisted 1‐ and 2‐Azaperopyrenes: Synthesis, Structure, and Properties
ABSTRACT A synthesis of hitherto unknown 1‐ and 2‐azaperopyrenes, twisted nitrogen‐doped peropyrenes, is reported. The synthesis is based on a Brønsted acid‐mediated benzannulation of alkynes. Key alkyne intermediates are synthesized via two complementary routes, including a Pd/C‐catalyzed, copper‐ and amine‐free Sonogashira‐type coupling of (hetero ...
Ricardo Molenda +4 more
wiley +1 more source
Induced Minor Free Graphs: Isomorphism and Clique-width
Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +1 more source
Reductions to Graph Isomorphism
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Degree theory for 4‐dimensional asymptotically conical gradient expanding solitons
Abstract We develop a new degree theory for 4‐dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over S3$S^3$ with non‐negative scalar curvature. We also obtain a similar existence result for cones whose link is diffeomorphic to S3/Γ$S^3/\
Richard H. Bamler, Eric Chen
wiley +1 more source
Isomorphic factorisations V: Directed graphs [PDF]
An isomorphic factorisation of a digraph D is a partition of its arcs into mutually isomorphic subgraphs. If such a factorisation of D into exactly t parts exists, then t must divide the number of arcs in D. This is called the divisibility condition.
Harary, Frank +2 more
openaire +2 more sources
ESG Performance Evolution in Retail: A Systematic Review and Meta‐Analysis
ABSTRACT Environmental, social, and governance (ESG) practices have transformed from peripheral corporate social responsibility initiatives into core strategic imperatives in retail. Despite growing interest, the literature remains fragmented across disciplines and geographic contexts, with no comprehensive sector‐specific analysis examining the ...
Jiyeon Kim, Wooyoung Yang
wiley +1 more source
Approximate Graph Isomorphism [PDF]
We study optimization versions of Graph Isomorphism. Given two graphs G1,G2, we are interested in finding a bijection π from V(G1) to V(G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges).
Vikraman Arvind +3 more
openaire +1 more source
Challenges and Enablers in Embedding SDGs Within Sustainability Reports
ABSTRACT This study explores how Sustainable Development Goals (SDGs) are integrated into sustainability reporting (SR), emphasizing the role of reporting in advancing transparency and sustainable development. Using a systematic literature review of 139 academic articles, the research identifies four thematic clusters: Communication, Determinant ...
Francesco Pacchera +4 more
wiley +1 more source

