Results 221 to 230 of about 187,749 (326)

Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation. [PDF]

Entropy (Basel)
de Jesus MR, Hoefel EOC, Angelo RM.
europepmc   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

J Chem Theory Comput
Golnik R, Gatter T, Stadler PF, Vassena N.   +3 more
europepmc   +1 more source

On a Clique‐Building Game of Erdős

Journal of Graph Theory, EarlyView.
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley   +1 more source

Spaces and sequences in the hippocampus: a homological perspective. [PDF]

J Comput Neurosci
Babichev A, Vashin V, Dabaghian Y.
europepmc   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Automorphisms of relatively hyperbolic groups and the Farrell-Jones conjecture. [PDF]

Math Ann
Andrew N, Guerch Y, Hughes S.
europepmc   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source

GFD analysis for BRE zeolite graph through reverse degree and reverse neighborhood degree based topological descriptors. [PDF]

Sci Rep
Yogalakshmi K, Easwaramoorthy D, Muhiuddin G, Abughazalah N, Kulish V.   +4 more
europepmc   +1 more source

Weak Degeneracy of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn, Eugene Lee, Evelyne Smith‐Roberge   +2 more
wiley   +1 more source