329 citations
- Technion – Israel Institute of TechnologyIL3 papers
- Cape Breton UniversityCA2 papers
- Center for NanoScienceDE2 papers
- Delft University of TechnologyNL2 papers
- Georgia Institute of TechnologyUS2 papers
- Hebrew University of JerusalemIL2 papers
- Ludwig-Maximilians-Universität MünchenDE2 papers
- University of OxfordGB2 papers
- University of ZurichCH2 papers
- Aarhus UniversityDK1 paper
- Apple (Israel)IL1 paper
- Arizona State UniversityUS1 paper
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011★ 1 cited
From spanning forests to edge subsets
Martin Trinks
We give some insight into Tutte's definition of internally and externally active edges for spanning forests. Namely we prove, that every edge subset can be constructed from the edg…
math.CO2011★ 21 cited
Domination Reliability
Klaus Dohmen, Peter Tittmann
We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to th…
math.CO2011★ 1 cited
The covered components polynomial: A new representation of the edge elimination polynomial
Martin Trinks
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of co…