Zobrazeno 1 - 10
of 594
pro vyhledávání: '"Tittmann P"'
Autor:
Alipour Maryam, Tittmann Peter
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 697-711 (2021)
The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G. In this paper, we investigate the behavior of this polynomial under several graph operations. S
Externí odkaz:
https://doaj.org/article/e61f1f25a1fe4c1a99db1fb02f52dd2e
Autor:
Katharina Steng, Friederike Roy, Harald Kellner, Julia Moll, Susanne Tittmann, Johanna Frotscher, Johanna Döring
Publikováno v:
Environmental Microbiome, Vol 19, Iss 1, Pp 1-16 (2024)
Abstract Background Sustainable agriculture increasingly emphasizes the importance of microbial communities in influencing plant health and productivity. In viticulture, understanding the impact of management practices on fungal communities is critic
Externí odkaz:
https://doaj.org/article/77e282eeaa5d4ee89aaf8c31c34e34c8
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 335-353 (2015)
This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition poly
Externí odkaz:
https://doaj.org/article/e12b523e78f94faab03e3cd9c9d0beb5
Autor:
Ibrahim, Hany, Tittmann, Peter
Given a family of graphs $\mathcal{H}$, a graph $G$ is $\mathcal{H}$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to any graph in $\mathcal{H}$. We present sufficient and necessary conditions for a graph $G$ such
Externí odkaz:
http://arxiv.org/abs/2212.10354
Autor:
Judit Tittmann, Tamás Ágh, Dalma Erdősi, Bettina Csanády, Erika Kövér, Antal Zemplényi, Sándor Kovács, Zoltán Vokó
Publikováno v:
Discover Oncology, Vol 15, Iss 1, Pp 1-11 (2024)
Abstract Objective Examining the distribution of breast cancer (BC) stage and molecular subtype among women aged below ( 65 years) the recommended screening age range helps to understand the screening program's characteristics and contributes to enha
Externí odkaz:
https://doaj.org/article/81d0956b651844c986e3476b790e51c8
Autor:
Lisa-Marie Funk, Gereon Poschmann, Fabian Rabe von Pappenheim, Ashwin Chari, Kim M. Stegmann, Antje Dickmanns, Marie Wensien, Nora Eulig, Elham Paknia, Gabi Heyne, Elke Penka, Arwen R. Pearson, Carsten Berndt, Tobias Fritz, Sophia Bazzi, Jon Uranga, Ricardo A. Mata, Matthias Dobbelstein, Rolf Hilgenfeld, Ute Curth, Kai Tittmann
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-18 (2024)
Abstract Besides vaccines, the development of antiviral drugs targeting SARS-CoV-2 is critical for preventing future COVID outbreaks. The SARS-CoV-2 main protease (Mpro), a cysteine protease with essential functions in viral replication, has been val
Externí odkaz:
https://doaj.org/article/721e5465cdfb4b73a39d8f7ff2da8167
Autor:
Ibrahim, Hany, Tittmann, Peter
A graph $G$ is $H$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to $H$. Given a graph $H$, we present sufficient and necessary conditions for a graph $G$ such that $G/e$ is $H$-free for any edge $e$ in $E(G)$. The
Externí odkaz:
http://arxiv.org/abs/2203.03491
Publikováno v:
Sensors, Vol 24, Iss 23, p 7748 (2024)
Ultrasound is an excellent way to acquire data that reveal useful information about systems operating in harsh environments, which may include elevated temperature, ionizing radiation, and aggressive chemicals. The effects of harsh environments on pi
Externí odkaz:
https://doaj.org/article/f90a698444e34f168ff26740507f85d9
Autor:
Dedndreaj, Kristina, Tittmann, Peter
Crapo introduced a construction of interval partitions of the Boolean lattice for sets equipped with matroid structure. This construction, in the context of graphic matroids, is related to the notion of edge activities introduced by Tutte. This impli
Externí odkaz:
http://arxiv.org/abs/2008.02006
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.