Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Tittmann Peter"'
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
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:
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
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
Autor:
Alipour, Maryam, Tittmann, Peter
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 operati
Externí odkaz:
http://arxiv.org/abs/1807.03971
Autor:
Ok, Seongmin, Tittmann, Peter
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving graph pro
Externí odkaz:
http://arxiv.org/abs/1702.03546
Autor:
Heinrich, Irene, Tittmann, Peter
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite subgraphs of its c
Externí odkaz:
http://arxiv.org/abs/1701.03453
The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by various pr
Externí odkaz:
http://arxiv.org/abs/1305.1475
The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the edge and v
Externí odkaz:
http://arxiv.org/abs/1207.2430