Antiparallel d-stable traces and a stronger version of ore problem

DOI10.1007/S00285-016-1077-2MaRDI QIDQ2014350zbMATH OpenOpenAlexWikidataFDO

Authors Jernej Rus

Publication date 11 August 2017

Published in Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.5806

zbMATH Keywords

spanning treestrands of DNAself-assembling\(d\)-stable tracedouble tracepolypeptide nanostructuresingle face embeddingstrong trace

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) General biology and biomathematics (92B05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15)

Abstract: In $2013$ a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chem. Bio. 9 (2013) 362--366]. It was since observed that a polyhedron $P$ can be realized by interlocking pairs of polypeptide chains if its corresponding graph $G(P)$ admits a strong trace. It was since also demonstrated that a similar strategy can also be expanded to self-assembly of designed DNA [Design principles for rapid folding of knotted DNA nanostructures, Nature communications 7 (2016) 1--8.]. In this direction, in the present paper we characterize graphs which admit closed walk which traverses every edge exactly once in each direction and for every vertex $v$, there is no subset $N$ of its neighbors, with $1leq|N|leqd$, such that every time the walk enters $v$ from $N$, it also exits to a vertex in $N$. This extends C. Thomassen's characterization [Bidirectional retracting-free double tracings and upper embeddability of graphs, J. Combin. Theory Ser. B 50 (1990) 198--207] for the case $d=1$.

Recommendations

• An iterative approach to the traceability conjecture for oriented graphs
• Progress on the traceability conjecture for oriented graphs
• A traceability conjecture for oriented graphs
• Antiweb-wheel inequalities and their separation problems over the stable set polytopes
• Triangle-free oriented graphs and the traceability conjecture
• On the trace norms of orientations of graphs
• An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles
• scientific article; zbMATH DE number 1151799
• Ore-type and Dirac-type theorems for matroids
• On Ore’s conjecture and its developments

Cites work

• scientific article; zbMATH DE number 3857153 (Why is no real title available?)
• scientific article; zbMATH DE number 3914375 (Why is no real title available?)
• scientific article; zbMATH DE number 3726397 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 2170341 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 6282155 (Why is no real title available?)
• scientific article; zbMATH DE number 3020563 (Why is no real title available?)
• A problem regarding the tracing of graphs
• ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
• Amalgamations of almost regular edge-colourings of simple graphs
• Bidirectional retracting-free double tracings and upper embeddability of graphs
• Bounds of the number of disjoint spanning trees
• Connected Detachments of Graphs and Generalized Euler Trails
• Doubly traversed Euler circuits
• Edge-Disjoint Spanning Trees of Finite Graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• Graphs on surfaces
• How to determine the maximum genus of a graph
• On Traversing Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On the surface duality of linear graphs
• Oriented walk double covering and bidirectional double tracing
• Strong traces model of self-assembly polypeptide structures
• Upper-embeddable graphs and related topics

Cited in

(7)

• Deriving graphs with a retracting-free bidirectional double tracing
• Strong traces model of self-assembly polypeptide structures
• An algebraic approach to enumerating non-equivalent double traces in graphs
• Parallelism of stable traces
• On the existence of \(F\)-strong trace of a graph when \(F\) induces a forest
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions

This page was built for publication: Antiparallel \(d\)-stable traces and a stronger version of ore problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014350)