منابع مشابه
Theta Graph Designs
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملMetamorphosis problems for graph designs
A λ-fold G-design of order n is a pair (X, B), where B is a collection of edge disjoint copies of the simple graph G which partitions the edge set of λK n (the undirected complete graph with n vertices) with vertex set X. Let (X, B) be a G-design and H be a subgraph of G. For each block b ∈ B, partition b into copies of H and G \ H and place the copy of H in B(H) and the edges belonging to the ...
متن کاملIncipient Spanning Clusters in Square and Cubic Percolation
The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the Hoshen-Kopelman algorithm. We measured the probabilities on the square lattice forming samples of rectangular strips with widths from 8 to 256 sites and lengths up ...
متن کاملMax-leaves spanning tree is APX-hard for cubic graphs
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.07.031