Parallelism of stable traces

DOI10.26493/2590-9770.1251.B76MaRDI QIDQ5198033zbMATH OpenOpenAlexFDO

Authors Jernej Rus

Publication date 2 October 2019

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Eulerian graphnanostructure designparallel \(d\)-stable tracepolypeptideself-assembling

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Kinetics in biochemical problems (pharmacokinetics, enzyme kinetics, etc.) (92C45) Applications of graph theory to circuits and networks (94C15)

Abstract: A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $XsubseteqN(v)$ with $1leq|N|leqd$ such that every time the walk enters $v$ from $X$, it also exits to a vertex in $X$. In the past, $d$-stable traces were investigated as a mathematical model for an innovative biotechnological procedure -- self-assembling of polypeptide structures. Among other, it was proven that graphs that admit parallel $d$-stable traces are precisely Eulerian graphs with minimum degree strictly larger than $d$. In the present paper we give an alternative, purely combinatorial proof of this result.

Recommendations

• scientific article; zbMATH DE number 708657
• Towards a stable trace formula
• scientific article; zbMATH DE number 4056993
• scientific article; zbMATH DE number 2086409
• A generalization of traces
• Trace estimates for stable processes
• scientific article; zbMATH DE number 6718569
• Stability of trace theorems on the sphere
• scientific article; zbMATH DE number 3796611
• Stable trace formulas and discrete series multiplicities

Cites work

• An algebraic approach to enumerating non-equivalent double traces in graphs
• Antiparallel \(d\)-stable traces and a stronger version of ore problem
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• scientific article; zbMATH DE number 3857153 (Why is no real title available?)
• scientific article; zbMATH DE number 3663181 (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?)
• Strong traces model of self-assembly polypeptide structures

Cited in

(3)

• Strong traces model of self-assembly polypeptide structures
• On the existence of F-strong trace of a graph when F induces a forest
• Linear time canonicalization and enumeration of non-isomorphic 1-face embeddings

This page was built for publication: Parallelism of stable traces

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