Distance-hereditary graphs are in important graph class theory, as they well-placed the hierarchy and permit many algorithmic results. We investigate structural advantages of a directed version this well-researched class. Since previously defined distance-hereditary digraphs do not recursive structure, we define twin-distance-hereditary graphs, which can be constructed by several twin pendant v...

In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending o...

the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...

Huang, X. 2017. Conducting Redox Polymers for Electrode Materials. Synthetic Strategies and Electrochemical Properties. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1604. 83 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0168-6. Organic electrode materials represent an intriguing alternative to their inorganic counterparts due...