Results 81 to 90 of about 615,797 (257)
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
Strategic Approaches to ESG Reporting: Analysing ESG Disclosures of Listed Companies
ABSTRACT This study adopts an exploratory approach to examine how firms communicate strategic orientation through ESG disclosures. Using a validated dictionary of exploration and exploitation language, we analyse 278 ESG reports from all UAE‐listed companies between 2020 and 2023, classifying ESG disclosures as exploration‐dominant, exploitation ...
Cintia Külzer‐Sacilotto +1 more
wiley +1 more source
Graph Isomorphism Algorithms: Investigation Of The Graph Isomorphism Problem [PDF]
As a precursor to possible applications of graph isomorphism to simulation, IST examined the current status of the computational complexity of graph ...
Franceschini, Robert W. +2 more
core
A 4-isomorphism of two graphs G, G' is a bijection \(\phi:E(G)\to E(G')\) such that both \(\phi\) and \(\phi^{-1}\) preserve homeomorphs of \(K_ 4\). It is proved that each 4-isomorphism between 4-connected graphs is induced by a (usual) graph isomorphism.
openaire +2 more sources
Who Cares About Carbon Performance Strategy? Ownership Structure as a Driver for Carbon Performance
ABSTRACT This research aims to highlight the empirical, theoretical, and corporate governance arguments employed in the academic literature that examines ownership structure as a determinant of carbon performance—a key element in contemporary climate governance frameworks.
Thicia Stela Lima Sampaio +2 more
wiley +1 more source
The Scheduling Model Based on Precedents
The paper presents an approach for university scheduling based on precedents. The model is based on the mathematical apparatus of the theory of graphs. The model uses the principles of finding and proof of the graph isomorphism. The process of finding of
S. Nesterenkov
doaj +2 more sources
Tits alternatives for graph products
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group satisfies this ...
Antolin, Yago, Minasyan, Ashot
core +1 more source
This work explores generative AI for automated revision of Piping and Instrumentation Diagrams (P&IDs). We frame P&ID correction as a translation problem, converting attributed P&ID graphs into sequences and learning revisions with a transformer‐based model.
Lukas Schulze Balhorn +5 more
wiley +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
On Isomorphisms of Vertex-transitive Graphs [PDF]
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non ...
Jing Chen, Binzhou Xia
openaire +3 more sources

