Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumber of connected spanning subgraphs on the Sierpinski gasket
115
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the number of connected spanning subgraphs $f_{d,b}(n)$ on the generalized Sierpinski gasket $SG_{d,b}(n)$ at stage $n$ with dimension $d$ equal to two, three and four for $b=2$, and layer $b$ equal to three and four for $d=2$. The upper and lower bounds for the asymptotic growth constant, defined as $z_{SG_{d,b}}=lim_{v to infty} ln f_{d,b}(n)/v$ where $v$ is the number of vertices, on $SG_{2,b}(n)$ with $b=2,3,4$ are derived in terms of the results at a certain stage. The numerical values of $z_{SG_{d,b}}$ are obtained.
rate research
Read More
Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage $n$ is a non-negative integer. For any given vertex $x$ of SG(n), we derive rigorously the probability distribution of the degree $j in {1,2,3,4}$ at the vertex and its value in the infinite $n$ limit. Adding up such probabilities of all the vertices divided by the number of vertices, we obtain the average probability distribution of the degree $j$. The corresponding limiting distribution $phi_j$ gives the average probability that a vertex is connected by 1, 2, 3 or 4 bond(s) among all the spanning tree configurations. They are rational numbers given as $phi_1=10957/40464$, $phi_2=6626035/13636368$, $phi_3=2943139/13636368$, $phi_4=124895/4545456$.
We study the number of acyclic orientations on the generalized two-dimensional Sierpinski gasket $SG_{2,b}(n)$ at stage $n$ with $b$ equal to two and three, and determine the asymptotic behaviors. We also derive upper bounds for the asymptotic growth constants for $SG_{2,b}$ and $d$-dimensional Sierpinski gasket $SG_d$.
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph $G$ and an integer $r_{uv}$ for every pair of vertices $u,vin V(G)$. The objective is to construct a subgraph $H$ of minimum weight which contains $r_{uv}$ edge-disjoint (or node-disjoint) $u$-$v$ paths. This is a fundamental problem in combinatorial optimization that captures numerous well-studied problems in graph theory and graph algorithms. In this paper, we consider the version of the problem where we are given a $lambda$-edge connected (di)graph $G$ with a non-negative weight function $w$ on the edges and an integer $k$, and the objective is to find a minimum weight spanning subgraph $H$ that is also $lambda$-edge connected, and has at least $k$ fewer edges than $G$. In other words, we are asked to compute a maximum weight subset of edges, of cardinality up to $k$, which may be safely deleted from $G$. Motivated by this question, we investigate the connectivity properties of $lambda$-edge connected (di)graphs and obtain algorithmically significant structural results. We demonstrate the importance of our structural results by presenting an algorithm running in time $2^{O(k log k)} |V(G)|^{O(1)}$ for $lambda$-ECS, thus proving its fixed-parameter tractability. We follow up on this result and obtain the {em first polynomial compression} for $lambda$-ECS on unweighted graphs. As a consequence, we also obtain the first fixed parameter tractable algorithm, and a polynomial kernel for a parameterized version of the classic Mininum Equivalent Graph problem. We believe that our structural results are of independent interest and will play a crucial role in the design of algorithms for connectivity-constrained problems in general and the SNDP problem in particular.
We derive exactly the number of Hamiltonian paths H(n) on the two dimensional Sierpinski gasket SG(n) at stage $n$, whose asymptotic behavior is given by $frac{sqrt{3}(2sqrt{3})^{3^{n-1}}}{3} times (frac{5^2 times 7^2 times 17^2}{2^{12} times 3^5 times 13})(16)^n$. We also obtain the number of Hamiltonian paths with one end at a certain outmost vertex of SG(n), with asymptotic behavior $frac {sqrt{3}(2sqrt{3})^{3^{n-1}}}{3} times (frac {7 times 17}{2^4 times 3^3})4^n$. The distribution of Hamiltonian paths on SG(n) with one end at a certain outmost vertex and the other end at an arbitrary vertex of SG(n) is investigated. We rigorously prove that the exponent for the mean $ell$ displacement between the two end vertices of such Hamiltonian paths on SG(n) is $ell log 2 / log 3$ for $ell>0$.
We calculate exponential growth constants $phi$ and $sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices, including square, triangular, honeycomb, and certain heteropolygonal Archimedean lattices. By studying the limiting values as the strip widths get large, we infer lower and upper bounds on these exponential growth constants for the respective infinite lattices. Since our lower and upper bounds are quite close to each other, we can infer very accurate approximate values for these exponential growth constants, with fractional uncertainties ranging from $O(10^{-4})$ to $O(10^{-2})$. We show that $phi$ and $sigma$, are monotonically increasing functions of vertex degree for these lattices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
