1,581 research outputs found
Vertex-deleted subgraphs and regular factors from regular graph
Let , and be three integers such that .
Let be a -regular, -edge-connected graph of odd order.
We obtain some sufficient conditions, which guarantee contains a
-factor for all
Isomorph-free generation of 2-connected graphs with applications
Many interesting graph families contain only 2-connected graphs, which have
ear decompositions. We develop a technique to generate families of unlabeled
2-connected graphs using ear augmentations and apply this technique to two
problems. In the first application, we search for uniquely K_r-saturated graphs
and find the list of uniquely K_4-saturated graphs on at most 12 vertices,
supporting current conjectures for this problem. In the second application, we
verifying the Edge Reconstruction Conjecture for all 2-connected graphs on at
most 12 vertices. This technique can be easily extended to more problems
concerning 2-connected graphs.Comment: 15 pages, 3 figures, 4 table
Some hard families of parameterised counting problems
We consider parameterised subgraph-counting problems of the following form:
given a graph G, how many k-tuples of its vertices have a given property? A
number of such problems are known to be #W[1]-complete; here we substantially
generalise some of these existing results by proving hardness for two large
families of such problems. We demonstrate that it is #W[1]-hard to count the
number of k-vertex subgraphs having any property where the number of distinct
edge-densities of labelled subgraphs that satisfy the property is o(k^2). In
the special case that the property in question depends only on the number of
edges in the subgraph, we give a strengthening of this result which leads to
our second family of hard problems.Comment: A few more minor changes. This version to appear in the ACM
Transactions on Computation Theor
Edge reconstruction of the Ihara zeta function
We show that if a graph has average degree , then the
Ihara zeta function of is edge-reconstructible. We prove some general
spectral properties of the edge adjacency operator : it is symmetric for an
indefinite form and has a "large" semi-simple part (but it can fail to be
semi-simple in general). We prove that this implies that if , one can
reconstruct the number of non-backtracking (closed or not) walks through a
given edge, the Perron-Frobenius eigenvector of (modulo a natural
symmetry), as well as the closed walks that pass through a given edge in both
directions at least once.
The appendix by Daniel MacDonald established the analogue for multigraphs of
some basic results in reconstruction theory of simple graphs that are used in
the main text.Comment: 19 pages, 2 pictures, in version 2 some minor changes and now
including an appendix by Daniel McDonal
- …