Results 111 to 120 of about 615,797 (257)
Line Graphs of Multigraphs and the Forbidden Graph E 6
Journal of Graph Theory, EarlyView.ABSTRACT The line graph Γ of a multigraph Δ is the graph whose vertices are the edges of Δ, where two such edges are adjacent if and only if they meet in a single vertex of Δ. We provide several characterizations of such line graphs and in particular show that a graph is a line graph if and only if it does not contain one of the 32 graphs, all of which
Hans Cuypers
wiley +1 more source
A (Sub)graph Isomorphism Identification Theorem
, 2022 It is generally accepted that graphs are natural representations of the relationships between items in complex systems, such as social networks, chemical compounds, and biological structures.
Mengjiao Guo (6738158)
core +1 more source
Graphs isomorphic to subgraphs of their line-graphs
Discrete Mathematics, 1982 AbstractAn embedding of graph G into graph H is by defenition an isomorphism of G onto a subgraph of H. It is shown in this paper that every unicycle U embeds in its line-graph L(U), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle in a natural way.
Douglas Bauer, Ralph Tindell
openaire +3 more sources
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
Mathematische Nachrichten, EarlyView.ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2016 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj +1 more source
Sliding Motions on Non‐Euclidean State Spaces: A Differential‐Geometric Perspective
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This paper extends sliding‐mode control theory to nonlinear systems evolving on smooth manifolds. Building on differential geometric methods, we reformulate Filippov's notion of solutions, characterize well‐defined vector fields on quotient spaces, and provide a consistent geometric definition of higher‐order sliding modes.
Fernando Castaños
wiley +1 more source
We review some of the most relevant properties related to graph isomorphism and graph components. First, we introduce some concepts related to graph traversal (walks, paths, cycles, circuits) and we introduce two natural concepts related to connectivity:
Dondi, Riccardo
core +1 more source
Portable network resolving huge-graph isomorphism problem
Machine Learning: Science and TechnologyThe graph isomorphism, as a key task in graph data analysis, is of great significance for the understanding, feature extraction, and pattern recognition of graph data.
Xin An +3 more
doaj +1 more source
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +1 more source
Benchmark Graphs for Practical Graph Isomorphism
CoRR, 2017 The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale almost linearly.
Daniel Neuen, Pascal Schweitzer
openaire +6 more sources