scholarly journals LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth

2012 ◽  
Vol 160 (15) ◽  
pp. 2089-2097 ◽  
Author(s):  
Archontia C. Giannopoulou ◽  
Paul Hunter ◽  
Dimitrios M. Thilikos
Keyword(s):  
Entropy ◽  
2020 ◽  
Vol 22 (11) ◽  
pp. 1295
Author(s):  
Naveed Ahmed Azam ◽  
Aleksandar Shurbevski ◽  
Hiroshi Nagamochi

Cycle rank is an important notion that is widely used to classify, understand, and discover new chemical compounds. We propose a method to enumerate all non-isomorphic tree-like graphs of a given cycle rank with self-loops and no multiple edges. To achieve this, we develop an algorithm to enumerate all non-isomorphic rooted graphs with the required constraints. The idea of our method is to define a canonical representation of rooted graphs and enumerate all non-isomorphic graphs by generating the canonical representation of rooted graphs. An important feature of our method is that for an integer n≥1, it generates all required graphs with n vertices in O(n) time per graph and O(n) space in total, without generating invalid intermediate structures. We performed some experiments to enumerate graphs with a given cycle rank from which it is evident that our method is efficient. As an application of our method, we can generate tree-like polymer topologies of a given cycle rank with self-loops and no multiple edges.


2009 ◽  
Vol 26 (2-3) ◽  
pp. 99-103 ◽  
Author(s):  
Yaakov Rosenfeld ◽  
Avshalom Strulov
Keyword(s):  

1988 ◽  
Vol 61 (2) ◽  
pp. 205-222 ◽  
Author(s):  
V. Galiatsatos ◽  
B. E. Eichinger

Abstract The formation of networks of various types has been simulated by using a physically realistic model that allows for intramolecular reactions to take place, thus forming loops of any size. The shortcomings of the kinetic approach, where systems are composed of functional groups that are selected at random without spatial constraint, and of the percolation method where an ordered arrangement is assured, are avoided. The reported simulations of the end-linking process illustrate the influence of intramolecular reactions on gel-sol distributions. Rings form in both phases, gel and sol. Neglect of the presence of cyclics in the sol underestimates the extent of the crosslinking reaction by several percent. On the other hand, in the gel fraction, loop defects are formed as the result of short-ranged intramolecular reactions. These defects do not vanish at complete conversion, and as a result they reduce the cycle rank in proportion to the number of primary chains reacting to form loops. The higher the molecular weight of the prepolymer chains, the closer to the perfect network the formed structure will be. Diffusion effects play an increasingly important role as the degree of polymerization goes up, so that reactions involving the end-linking of very long chains may never come into completion. The simulation results show that sol structures are highly dependent upon the functionality of the crosslinking agent used in the end-linking process. The intramolecular reactions which occur in substantial proportion at higher degrees of crosslinking necessarily favor formation of cyclics. In the case of tetrafunctional networks, this results in a bimodal molecular weight distribution of the sol constituents. It is important to realize that, according to the results of our simulation, networks obtained near complete conversions are very close to perfect. In the case of the random networks cured by high-energy radiation, we show that their properties are quite different when compared to those resulting from other crosslinking techniques. The defect structures account for a large portion of the mass of the networks and their mechanical moduli, as represented by the cycle rank per chain, are substantially smaller than the model networks. Results on both poly(dimethylsiloxane) and polyethylene show that chain scission is rather important. It should be kept in mind that primary chain branching and the molecular weight distribution affect the behavior of a polymeric system when it is exposed to radiation. The fact that the algorithm gives reliable results for more than one polymeric system shows the flexibility of the simulation program; it also proves that the assumptions used to build the model form a realistic basis for future work. A number of upgrades are being incorporated in the model at the present time. Instead of relying on the Gaussian distribution of chain ends, a more realistic model incorporating Flory's rotational isomeric state theory is being used to generate the prepolymer chains. The simulations are being applied to a number of different systems, including polyoxypropylene- and polyoxyethylene-based urethane networks. In addition, filled networks and sulfur vulcanization systems are slated to be explored in order to try to understand their rather complicated behavior. Computer simulations prove to be a powerful tool to study network structure problems. Questions about the detailed structure of the elastomer, sol-gel transitions, and the mechanical properties can be given reliable answers. Wherever there is sufficient knowledge of the reaction system and enough experimental data for comparison, computer simulations can provide information of unprecedented depth and accuracy.


2012 ◽  
Vol Vol. 14 no. 2 (Automata, Logic and Semantics) ◽  
Author(s):  
Hermann Gruber

Automata, Logic and Semantics International audience We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this connection, and obtain several new algorithmic insights regarding both cycle rank and star height. Among other results, we show that computing the cycle rank is NP-complete, even for sparse digraphs of maximum outdegree 2. Notwithstanding, we provide both a polynomial-time approximation algorithm and an exponential-time exact algorithm for this problem. The former algorithm yields an O((log n)^(3/2))- approximation in polynomial time, whereas the latter yields the optimum solution, and runs in time and space O*(1.9129^n) on digraphs of maximum outdegree at most two. Regarding the star height problem, we identify a subclass of the regular languages for which we can precisely determine the computational complexity of the star height problem. Namely, the star height problem for bideterministic languages is NP-complete, and this holds already for binary alphabets. Then we translate the algorithmic results concerning cycle rank to the bideterministic star height problem, thus giving a polynomial-time approximation as well as a reasonably fast exact exponential algorithm for bideterministic star height.


1998 ◽  
Vol 126 (12) ◽  
pp. 3715-3720 ◽  
Author(s):  
R. N. Cruz ◽  
K. A. de Rezende
Keyword(s):  

2020 ◽  
Vol 12 (02) ◽  
pp. 2050027
Author(s):  
Michael Cary

We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be significantly better when an even graph admits a cycle decomposition in which any two cycles intersect in at most one vertex. Links between the cycle rank of the cycle intersection graph of an even graph and the decycling number of the even graph itself are found. The problem of choosing an ideal cycle decomposition is addressed and is presented as an optimization problem over the space of cycle decompositions of even graphs, and we conjecture that the upper bound for the decycling number of even graphs presented in this paper is best possible.


1994 ◽  
Vol 3 (1) ◽  
pp. 1-11 ◽  
Author(s):  
D. K. Arrowsmith ◽  
J. W. Essam

We consider special types of mod-λ flows, called odd and even mod-λ flows, for directed graphs, and prove that the numbers of such flows can be interpolated by polynomials in λ with the degree given by the cycle rank of the graph. The proofs involve computation of the number of integer solutions in a polyhedral region of Euclidean space using theorems due to Ehrhart. The resulting reciprocity properties of the interpolating polynomials for even flows are considered. The analogous properties of odd and even mod-λ potential differences and their associated potentials are also developed.


Filomat ◽  
2019 ◽  
Vol 33 (7) ◽  
pp. 2031-2049
Author(s):  
Irina Gelbukh

For a connected locally path-connected topological space X and a continuous function f on it such that its Reeb graph Rf is a finite topological graph, we show that the cycle rank of Rf, i.e., the first Betti number b1(Rf), in computational geometry called number of loops, is bounded from above by the co-rank of the fundamental group ?1(X), the condition of local path-connectedness being important since generally b1(Rf) can even exceed b1(X). We give some practical methods for calculating the co-rank of ?1(X) and a closely related value, the isotropy index. We apply our bound to improve upper bounds on the distortion of the Reeb quotient map, and thus on the Gromov-Hausdorff approximation of the space by Reeb graphs, for the distance function on a compact geodesic space and for a simple Morse function on a closed Riemannian manifold. This distortion is bounded from below by what we call the Reeb width b(M) of a metric space M, which guarantees that any real-valued continuous function on M has large enough contour (connected component of a level set). We show that for a Riemannian manifold, b(M) is non-zero and give a lower bound on it in terms of characteristics of the manifold. In particular, we show that any real-valued continuous function on a closed Euclidean unit ball E of dimension at least two has a contour C with diam(C??E)??3.


1989 ◽  
Vol 62 (5) ◽  
pp. 800-819 ◽  
Author(s):  
J. P. Queslel

Abstract Characterization of randomly crosslinked networks requires a topological description of imperfect network structure and a molecular-elasticity theory, preferably with a minimum number of adjustable parameters, relating macroscopic stress and strain or swelling ratios to molecular deformation. It is shown that simple relationships exist between the molecular weight between consecutive junctions, the molecular weight of linear precursor chains, the cycle rank, and the number of junctions for networks having no defects other than chain ends. The idealized affine deformation model (in which the constraints on junction fluctuations are infinite) and the idealized phantom-chain model (in which the constraints are absent) are inadequate for network characterization. The more realistic Flory-Erman constrained junction model is applied to the description of cis-polyisoprene cured with dicumyl peroxide. Swelling equilibrium experiments are in agreement with stress-strain measurements. Analysis of these stress-strain data with the constrained-junction and constrained-chain models gives similar results. This validates the Flory hypothesis that it is generally sufficient to concentrate the effects of the constraints on the junctions. Nevertheless, the constrained chain model proposed by Erman and Monnerie has the advantage of depending on one parameter, KG, instead of two, κ and ζ, for the constrained junction model.


Sign in / Sign up

Export Citation Format

Share Document