Relevant bibliographies by topics / Partition en cycles disjoints / Journal articles
To see the other types of publications on this topic, follow the link: Partition en cycles disjoints.

Journal articles on the topic 'Partition en cycles disjoints'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Partition en cycles disjoints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Kandan, P. "Multidecomposition of cartesian product of some graphs into even cycles and matchings." Filomat 31, no. 18 (2017): 5525–37. http://dx.doi.org/10.2298/fil1718525k.

Full text
Abstract:
Let C2p and pK2 denote a cycle with 2p edges and p vertex-disjoint edges, respectively. For graphs G,H' and H'',a (H',H'')-multidecomposition of G is a partition of the edge set of G into copies of H' and copies of H'' with at least one copy of H' and at least one copy of H''. In this paper, we investigate (C2p, pK2)-multidecomposition of the Cartesian product of paths, cycles and complete graphs, for some values p ? 3.
APA, Harvard, Vancouver, ISO, and other styles
2

Irving, John. "Minimal Transitive Factorizations of Permutations into Cycles." Canadian Journal of Mathematics 61, no. 5 (2009): 1092–117. http://dx.doi.org/10.4153/cjm-2009-052-2.

Full text
Abstract:
Abstract. We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings, that is, we study the number ${{H}_{\alpha }}({{i}_{2}},{{i}_{3}},...)$) of ways a given permutation (with cycles described by the partition $\alpha $) can be decomposed into a product of exactly ${{i}_{2}}$ 2-cycles, ${{i}_{3}}$ 3-cycles, etc., with certain minimality and transitivity conditions imposed on the factors. The method is to encode such factorizations as planar maps with certain descent structure and apply a new combinatorial decomposition to make their enumeration more manageable. We apply our technique to determine ${{H}_{\alpha }}({{i}_{2}},{{i}_{3}},...)$ when $\alpha $ has one or two parts, extending earlier work of Goulden and Jackson. We also show how these methods are readily modified to count inequivalent factorizations, where equivalence is defined by permitting commutations of adjacent disjoint factors. Our technique permits us to generalize recent work of Goulden, Jackson, and Latour, while allowing for a considerable simplification of their analysis.
APA, Harvard, Vancouver, ISO, and other styles
3

DeTemple, Duane, and Jack M. Robertson. "Graphs associated with triangulations of lattice polygons." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no. 3 (1989): 391–98. http://dx.doi.org/10.1017/s1446788700033115.

Full text
Abstract:
AbstractTwo graphs, the edge crossing graph E and the triangle graph T are associated with a simple lattice polygon. The maximal independent sets of vertices of E and T are derived including a formula for the size of the fundamental triangles. Properties of E and T are derived including a formula for the size of the maximal independent sets in E and T. It is shown that T is a factor graph of edge-disjoint 4-cycles, which gives corresponding geometric information, and is a partition graph as recently defined by the authors and F. Harary.
APA, Harvard, Vancouver, ISO, and other styles
4

Xu, Guangjun, Qiang Sun, and Zuosong Liang. "On Hamiltonian Decomposition Problem of 3-Arc Graphs." Computational Intelligence and Neuroscience 2022 (April 28, 2022): 1–6. http://dx.doi.org/10.1155/2022/5837405.

Full text
Abstract:
A 4-tuple y , x , v , w in a graph is a 3-arc if each of y , x , v and x , v , w is a path. The 3-arc graph of H is the graph with vertex set all arcs of H and edge set containing all edges joining x y and v w whenever y , x , v , w is a 3-arc of H . A Hamilton cycle is a closed path meeting each vertex of a graph. A graph H including a Hamilton cycle is called Hamiltonian and H has a Hamiltonian decomposition provided its edge set admits a partition into disjoint Hamilton cycles (possibly with a single perfect matching). The current paper proves that every connected 3-arc graph consists of more than one Hamilton cycle. Since the 3-arc graph of a cubic graph is 4-regular, it further proves that each 3-arc graph of a cubic graph in a certain family has a Hamiltonian decomposition.
APA, Harvard, Vancouver, ISO, and other styles
5

Hartke, Stephen G., and Tyler Seacrest. "Random partitions and edge-disjoint Hamiltonian cycles." Journal of Combinatorial Theory, Series B 103, no. 6 (2013): 742–66. http://dx.doi.org/10.1016/j.jctb.2013.09.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, C. C., and G. P. Jin. "Cycle Partitions in Graphs." Combinatorics, Probability and Computing 5, no. 2 (1996): 95–97. http://dx.doi.org/10.1017/s0963548300001887.

Full text
Abstract:
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
APA, Harvard, Vancouver, ISO, and other styles
7

Borgwardt, Steffen. "On the diameter of partition polytopes and vertex-disjoint cycle cover." Mathematical Programming 141, no. 1-2 (2011): 1–20. http://dx.doi.org/10.1007/s10107-011-0504-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jung, Ho Yub, and Kyoung Mu Lee. "Image Segmentation by Edge Partitioning over a Nonsubmodular Markov Random Field." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/683176.

Full text
Abstract:
Edge weight-based segmentation methods, such as normalized cut or minimum cut, require a partition number specification for their energy formulation. The number of partitions plays an important role in the segmentation overall quality. However, finding a suitable partition number is a nontrivial problem, and the numbers are ordinarily manually assigned. This is an aspect of the general partition problem, where finding the partition number is an important and difficult issue. In this paper, the edge weights instead of the pixels are partitioned to segment the images. By partitioning the edge weights into two disjoints sets, that is, cut and connect, an image can be partitioned into all possible disjointed segments. The proposed energy function is independent of the number of segments. The energy is minimized by iterating the QPBO-α-expansion algorithm over the pairwise Markov random field and the mean estimation of the cut and connected edges. Experiments using the Berkeley database show that the proposed segmentation method can obtain equivalently accurate segmentation results without designating the segmentation numbers.
APA, Harvard, Vancouver, ISO, and other styles
9

Liebenau, Anita, and Yanitsa Pehova. "An approximate version of Jackson’s conjecture." Combinatorics, Probability and Computing 29, no. 6 (2020): 886–99. http://dx.doi.org/10.1017/s0963548320000152.

Full text
Abstract:
AbstractA diregular bipartite tournament is a balanced complete bipartite graph whose edges are oriented so that every vertex has the same in- and out-degree. In 1981 Jackson showed that a diregular bipartite tournament contains a Hamilton cycle, and conjectured that in fact its edge set can be partitioned into Hamilton cycles. We prove an approximate version of this conjecture: for every ε > 0 there exists n0 such that every diregular bipartite tournament on 2n ≥ n0 vertices contains a collection of (1/2–ε)n cycles of length at least (2–ε)n. Increasing the degree by a small proportion allows us to prove the existence of many Hamilton cycles: for every c > 1/2 and ε > 0 there exists n0 such that every cn-regular bipartite digraph on 2n ≥ n0 vertices contains (1−ε)cn edge-disjoint Hamilton cycles.
APA, Harvard, Vancouver, ISO, and other styles
10

Lichiardopol, Nicolas. "Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi." International Journal of Combinatorics 2012 (August 3, 2012): 1–9. http://dx.doi.org/10.1155/2012/273416.

Full text
Abstract:
It was proved (Bessy et al., 2010) that for r≥1, a tournament with minimum semidegree at least 2r−1 contains at least r vertex-disjoint directed triangles. It was also proved (Lichiardopol, 2010) that for integers q≥3 and r≥1, every tournament with minimum semidegree at least (q−1)r−1 contains at least r vertex-disjoint directed cycles of length q. None information was given on these directed cycles. In this paper, we fill a little this gap. Namely, we prove that for d≥1 and r≥1, every tournament of minimum outdegree at least ((d2+3d+2)/2)r−(d2+d+2)/2 contains at least r vertex-disjoint strongly connected subtournaments of minimum outdegree d. Next, we prove for tournaments a conjecture of Stiebitz stating that for integers s≥1 and t≥1, there exists a least number f(s,t) such that every digraph with minimum outdegree at least f(s,t) can be vertex-partitioned into two sets inducing subdigraphs with minimum outdegree at least s and at least t, respectively. Similar results related to the semidegree will be given. All these results are consequences of two results concerning the maximum order of a tournament of minimum outdegree d (of minimum semidegree d) not containing proper subtournaments of minimum outdegree d (of minimum semidegree d).
APA, Harvard, Vancouver, ISO, and other styles
11

Raeisi, Ghaffar, and Ali Zaghian. "Ramsey Number of Wheels Versus Cycles and Trees." Canadian Mathematical Bulletin 59, no. 01 (2016): 190–96. http://dx.doi.org/10.4153/cmb-2015-057-5.

Full text
Abstract:
Abstract Let G 1, G 2 , …, Gt be arbitrary graphs. The Ramsey number R(G 1 , G 2, …, Gt ) is the smallest positive integer n such that if the edges of the complete graph Kn are partitioned into t disjoint color classes giving t graphs H 1, H 2, …, H t, then at least one Hi has a subgraph isomorphic to Gi. In this paper, we provide the exact value of the R(Tn, Wm) for odd m, n ≥ m−1, where T n is either a caterpillar, a tree with diameter at most four, or a tree with a vertex adjacent to at least leaves, and W n is the wheel on n + 1 vertices. Also, we determine R(C n, W m) for even integers n and m, n ≥ m + 500, which improves a result of Shi and confirms a conjecture of Surahmat et al. In addition, the multicolor Ramsey number of trees versus an odd wheel is discussed in this paper.
APA, Harvard, Vancouver, ISO, and other styles
12

Enomoto, Hikoe, and Hao Li. "Partition of a graph into cycles and degenerated cycles." Discrete Mathematics 276, no. 1-3 (2004): 177–81. http://dx.doi.org/10.1016/s0012-365x(03)00300-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Enomoto, Hikoe. "Graph partition problems into cycles and paths." Discrete Mathematics 233, no. 1-3 (2001): 93–101. http://dx.doi.org/10.1016/s0012-365x(00)00229-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Wang, Hong. "Partition of a bipartite graph into cycles." Discrete Mathematics 117, no. 1-3 (1993): 287–91. http://dx.doi.org/10.1016/0012-365x(93)90345-t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Li, Guan Ru, Yi Ming Lei, and Jirimutu. "Decomposing Complete 3-Uniform Hypergraph into 5-Cycles." Applied Mechanics and Materials 672-674 (October 2014): 1935–39. http://dx.doi.org/10.4028/www.scientific.net/amm.672-674.1935.

Full text
Abstract:
About the Katona-Kierstead definition of a Hamiltonian cycles in a uniform hypergraph, a decomposition of complete k-uniform hypergraph Kn(k) into Hamiltonian cycles studied by Bailey-Stevens and Meszka-Rosa. For n≡2,4,5 (mod 6), we design algorithm for decomposing the complete 3-uniform hypergraphs into Hamiltonian cycles by using the method of edge-partition. A decomposition of Kn(3) into 5-cycles has been presented for all admissible n≤17, and for all n=4m +1, m is a positive integer. In general, the existence of a decomposition into 5-cycles remains open. In this paper, we use the method of edge-partition and cycle sequence proposed by Jirimutu and Wang. We find a decomposition of K20(3) into 5-cycles.
APA, Harvard, Vancouver, ISO, and other styles
16

Hu, Zhiquan, and Hao Li. "Partition of a graph into cycles and vertices." Discrete Mathematics 307, no. 11-12 (2007): 1436–40. http://dx.doi.org/10.1016/j.disc.2005.11.081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

LEADER, IMRE, and PAUL A. RUSSELL. "SPARSE PARTITION REGULARITY." Proceedings of the London Mathematical Society 93, no. 3 (2006): 545–69. http://dx.doi.org/10.1017/s0024611506015887.

Full text
Abstract:
Our aim in this paper is to prove Deuber's conjecture on sparse partition regularity, that for every $m$, $p$ and $c$ there exists a subset of the natural numbers whose $(m,p,c)$-sets have high girth and chromatic number. More precisely, we show that for any $m$, $p$, $c$, $k$ and $g$ there is a subset $S$ of the natural numbers that is sufficiently rich in $(m,p,c)$-sets that whenever $S$ is $k$-coloured there is a monochromatic $(m,p,c)$-set, yet is so sparse that its $(m,p,c)$-sets do not form any cycles of length less than $g$.Our main tools are some extensions of Nešetřil–Rödl amalgamation and a Ramsey theorem of Bergelson, Hindman and Leader. As a sideline, we obtain a Ramsey theorem for products of trees that may be of independent interest.
APA, Harvard, Vancouver, ISO, and other styles
18

Wei, Changcheng, Muhammad Faisal Nadeem, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem, Jia-Bao Liu, and Adnan Khalil. "On Partition Dimension of Some Cycle-Related Graphs." Mathematical Problems in Engineering 2021 (March 5, 2021): 1–8. http://dx.doi.org/10.1155/2021/4046909.

Full text
Abstract:
Let G be a simple connected graph. Suppose Δ = Δ 1 , Δ 2 , … , Δ l an l -partition of V G . A partition representation of a vertex α w . r . t Δ is the l − vector d α , Δ 1 , d α , Δ 2 , … , d α , Δ l , denoted by r α | Δ . Any partition Δ is referred as resolving partition if ∀ α i ≠ α j ∈ V G such that r α i | Δ ≠ r α j | Δ . The smallest integer l is referred as the partition dimension pd G of G if the l -partition Δ is a resolving partition. In this article, we discuss the partition dimension of kayak paddle graph, cycle graph with chord, and a graph generated by chain of cycles. It has been shown that the partition dimension of the said families of graphs is constant.
APA, Harvard, Vancouver, ISO, and other styles
19

Amar, Denise. "Partition of a bipartite hamiltonian graph into two cycles." Discrete Mathematics 58, no. 1 (1986): 1–10. http://dx.doi.org/10.1016/0012-365x(86)90181-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Meihua, Meihua, Meiling Guan, and Jirimutu Jirimutu. "Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles." Opuscula Mathematica 39, no. 3 (2019): 383–93. http://dx.doi.org/10.7494/opmath.2019.39.3.383.

Full text
Abstract:
We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\), we design an algorithm for decomposing the complete 3-uniform hypergraphs into Hamiltonian cycles by using the method of edge-partition. A decomposition of \(K^{(3)}_{n}\) into 5-cycles has been presented for all admissible \(n\leq17\), and for all \(n=4^{m}+1\) when \(m\) is a positive integer. In general, the existence of a decomposition into 5-cycles remains open. In this paper, we show if \(42~|~(n-1)(n-2)\) and if there exist \(\lambda=\frac{(n-1)(n-2)}{42}\) sequences \((k_{i_{0}},k_{i_{1}},\ldots,k_{i_{6}})\) on \(D_{all}(n)\), then \(K^{(3)}_{n}\) can be decomposed into 7-cycles. We use the method of edge-partition and cycle sequence. We find a decomposition of \(K^{(3)}_{37}\) and \(K^{(3)}_{43}\) into 7-cycles.
APA, Harvard, Vancouver, ISO, and other styles
21

Borse, Y. M., and S. R. Shaikh. "Decomposition of the product of cycles based on degree partition." Discussiones Mathematicae Graph Theory 39, no. 1 (2019): 241. http://dx.doi.org/10.7151/dmgt.2066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Wang, Hong, Charles Little, and Kee Teo. "Partition of a directed bipartite graph into two directed cycles." Discrete Mathematics 160, no. 1-3 (1996): 283–89. http://dx.doi.org/10.1016/0012-365x(95)00165-s.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Sibuya, Masaaki. "Random partition of a finite set by cycles of permutation." Japan Journal of Industrial and Applied Mathematics 10, no. 1 (1993): 69–84. http://dx.doi.org/10.1007/bf03167203.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Ghanem, Manal, Hasan Al-Ezeh, and Ala’a Dabbour. "Locating Chromatic Number of Powers of Paths and Cycles." Symmetry 11, no. 3 (2019): 389. http://dx.doi.org/10.3390/sym11030389.

Full text
Abstract:
Let c be a proper k-coloring of a graph G. Let π = { R 1 , R 2 , … , R k } be the partition of V ( G ) induced by c, where R i is the partition class receiving color i. The color code c π ( v ) of a vertex v of G is the ordered k-tuple ( d ( v , R 1 ) , d ( v , R 2 ) , … , d ( v , R k ) ) , where d ( v , R i ) is the minimum distance from v to each other vertex u ∈ R i for 1 ≤ i ≤ k . If all vertices of G have distinct color codes, then c is called a locating k-coloring of G. The locating-chromatic number of G, denoted by χ L ( G ) , is the smallest k such that G admits a locating coloring with k colors. In this paper, we give a characterization of the locating chromatic number of powers of paths. In addition, we find sharp upper and lower bounds for the locating chromatic number of powers of cycles.
APA, Harvard, Vancouver, ISO, and other styles
25

Dahmane, Selma, Christine Doucet, Antoine Le Gall, et al. "Nanoscale organization of tetraspanins during HIV-1 budding by correlative dSTORM/AFM." Nanoscale 11, no. 13 (2019): 6036–44. http://dx.doi.org/10.1039/c8nr07269h.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Wood, D. W. "The algebraic construction of partition function zeros: universality and algebraic cycles." Journal of Physics A: Mathematical and General 20, no. 11 (1987): 3471–93. http://dx.doi.org/10.1088/0305-4470/20/11/048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Vanchurin, Vitaly. "Differential equation for partition functions and a duality pseudo-forest." Journal of Mathematical Physics 63, no. 7 (2022): 073501. http://dx.doi.org/10.1063/5.0004357.

Full text
Abstract:
We consider finite quantum systems defined by a mixed set of commutation and anti-commutation relations between components of the Hamiltonian operator. These relations are represented by an anti-commutativity graph that contains necessary and sufficient information for computing the full quantum partition function. We derive a second-order differential equation for an extended partition function z[ β, β′, J] that describes a transformation from a “parent” partition function z[0, β′, J] (or anti-commutativity graph) to a “child” partition function z[ β, 0, J] (or anti-commutativity graph). The procedure can be iterated, and then one forms a pseudo-forest of duality transformations between quantum systems, i.e., a directed graph in which every vertex (or quantum system) has at most one incoming edge (from its parent system). The pseudo-forest has a single tree connected to a constant partition function, many pseudo-trees connected to self-dual systems, and all other pseudo-trees connected to closed cycles of transformations between mutually dual systems. We also show how the differential equation for the extended partition function can be used to study disordered systems.
APA, Harvard, Vancouver, ISO, and other styles
28

Paulraj Joseph, J., and S. Rosalin. "Induced cycle path number of derived graphs." Discrete Mathematics, Algorithms and Applications 08, no. 04 (2016): 1650066. http://dx.doi.org/10.1142/s179383091650066x.

Full text
Abstract:
An induced cycle path partition of a simple connected graph [Formula: see text] is a partition of [Formula: see text] into subsets such that the subsets induce cycles and paths. The minimum order taken over all induced cycle path partitions is called the induced cycle path number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we investigate the induced cycle path number of some derived graphs such as line graph, block graph, subdivision graph, power graph and total graph.
APA, Harvard, Vancouver, ISO, and other styles
29

Chen, Xiang-Lian, and Jian-Liang Wu. "The linear arboricity of planar graphs without 5-cycles with two chords." Filomat 30, no. 5 (2016): 1135–42. http://dx.doi.org/10.2298/fil1605135c.

Full text
Abstract:
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G,la(G)=?(?(G)/2)? if ?(G) ? 7 and G has no 5-cycles with two chords.
APA, Harvard, Vancouver, ISO, and other styles
30

BANG-JENSEN, JØRGEN, GREGORY GUTIN, and ANDERS YEO. "Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments." Combinatorics, Probability and Computing 6, no. 3 (1997): 255–61. http://dx.doi.org/10.1017/s0963548397003027.

Full text
Abstract:
Thomassen [6] conjectured that if I is a set of k−1 arcs in a k-strong tournament T, then T−I has a Hamiltonian cycle. This conjecture was proved by Fraisse and Thomassen [3]. We prove the following stronger result. Let T=(V, A) be a k-strong tournament on n vertices and let X1, X2, [ctdot ], Xl be a partition of the vertex set V of T such that [mid ]X1[mid ][les ][mid ]X2[mid ] [les ][ctdot ][les ][mid ]Xl[mid ]. If k[ges ][sum ] l−1i=1[lfloor ] [mid ]Xi[mid ]/2[rfloor ]+[mid ]Xl[mid ], then T−∪li=1 {xy∈A[ratio ]x, y∈Xi} has a Hamiltonian cycle. The bound on k is sharp.
APA, Harvard, Vancouver, ISO, and other styles
31

Atamtürk, Alper, and Deepak Rajan. "Partition inequalities for capacitated survivable network design based on directed p-cycles." Discrete Optimization 5, no. 2 (2008): 415–33. http://dx.doi.org/10.1016/j.disopt.2007.08.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Li, Rao. "Spectral conditions for the Bipancyclic Bipartite graphs." Open Journal of Discrete Applied Mathematics 4, no. 2 (2021): 48–51. http://dx.doi.org/10.30538/psrp-odam2021.0058.

Full text
Abstract:
Let \(G = (X, Y; E)\) be a bipartite graph with two vertex partition subsets \(X\) and \(Y\). \(G\) is said to be balanced if \(|X| = |Y|\) and \(G\) is said to be bipancyclic if it contains cycles of every even length from \(4\) to \(|V(G)|\). In this note, we present spectral conditions for the bipancyclic bipartite graphs.
APA, Harvard, Vancouver, ISO, and other styles
33

Barletta, Luca, and Arnaldo Spalvieri. "Design of Short, High-Rate DVB-S2-Like Semi-Regular LDPC Codes." Research Letters in Communications 2008 (2008): 1–4. http://dx.doi.org/10.1155/2008/324503.

Full text
Abstract:
This work focuses on high-rate () moderate-length () low-density parity-check codes. High-rate codes allow to maintain good quality of the preliminary decisions that are used in carrier recovery, while a moderate code length allows to keep the latency low. The interleaver of the LDPC matrix that we consider is inspired to the DVB-S2 standard one. A novel approach for avoiding short cycles is analyzed. A modified BP decoding algorithm is applied in order to deal with longer cycles. Simulations and results for the AWGN channel are presented, both for BPSK signalling and for coded modulation based on the partition .
APA, Harvard, Vancouver, ISO, and other styles
34

Ellingham, M. N. "Isomorphic factorization of regular graphs of even degree." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 44, no. 3 (1988): 402–20. http://dx.doi.org/10.1017/s1446788700032183.

Full text
Abstract:
AbstractA graph G is divisible by t if its edge set can be partitioned into t subsets, such that the subgraphs (called factors) induced by the subsets are all isomorphic. Such an edge partition is an isomorphic factorization. It is proved that a 2k-regular graph with an even number of vertices is divisble by 2k provided it contains either no 3-cycles or no 5-cycles. It is also shown that any 4-regular graph with an even number of vertices is divisible by 4. In both cases the components of the factors found are paths of length 1 and 2, and the factorizations can be constructed in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
35

Baldwin, R. Lee, James France, David E. Beever, Margaret Gill, and John H. M. Thornley. "Metabolism of the lactating cow: III. Properties of mechanistic models suitable for evaluation of energetic relationships and factors involved in the partition of nutrients." Journal of Dairy Research 54, no. 1 (1987): 133–45. http://dx.doi.org/10.1017/s0022029900025243.

Full text
Abstract:
SummaryTWO models of lactating dairy cows were constructed by combining mechanistic models of digestion and metabolism reported previously and by adding elements to allow simulation of changes in tissue metabolic capacities over time. One model (day version) had an integration interval of 0·005 d and was suitable for simulation of within-day dynamics of nutrient supply and partition. The other (lactation version) had an integration interval of 1 d and was suitable for simulation of full lactation cycles. A number of simulation analyses were conducted to characterize and evaluate the models, to examine quantitative and dynamic properties of mechanisms which influence partition of nutrients, to identify aspects requiring further study, and to illustrate the potential usefulness of mechanistic, as compared to empirical, models in analyses of energy balance in lactating dairy cows.
APA, Harvard, Vancouver, ISO, and other styles
36

Fujita, Shinya. "Degree conditions for the partition of a graph into cycles, edges and isolated vertices." Discrete Mathematics 309, no. 11 (2009): 3534–40. http://dx.doi.org/10.1016/j.disc.2007.12.056.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Beauchamp, Hélène. "The Repère Cycles: From basic to continuous education." Canadian Theatre Review 78 (March 1994): 26–31. http://dx.doi.org/10.3138/ctr.78.006.

Full text
Abstract:
After graduating from the Conservatoire d’art dramatique de Québec in 1970, Lessard founded several groups for collective creation, between 1970 and 1978, and taught at the Collège de Lévis and at the Conservatoire d’art dramatique de Québec. By 1978 he had grown increasingly unhappy with the model for creative processes based solely on spontaneity as a guide to artistic process and began searching for more systematic ways of encouraging creativity in actors and guiding work in collectives. He left Quebec City to study with Anna Halprin at the San Francisco Dancers’ Workshop. In California he discovered the RSVP Cycles (resources, scores, evaluation, and performance) used by landscape architect Lawrence Halprin for architectural and urban planning.2 Lessard’s adaptation of Halprin’s four-part charting of the process of creative endeavour to work in the theatre as the repère cycles: resources, partition, évaluation, représentation. In 1980 he returned to Quebec City and founded Théâtre Repère with a group of young actors from the Conservatoire,3 amongst whom was Robert Lepage.4
APA, Harvard, Vancouver, ISO, and other styles
38

Zhang, Xian-Kun, Song Fei, Chen Song, Xue Tian, and Yang-Yue Ao. "Label propagation algorithm based on local cycles for community detection." International Journal of Modern Physics B 29, no. 05 (2015): 1550029. http://dx.doi.org/10.1142/s0217979215500290.

Full text
Abstract:
Label propagation algorithm (LPA) has been proven to be an extremely fast method for community detection in large complex networks. But an important issue of the algorithm has not yet been properly addressed that random update orders in label propagation process hamper the algorithm robustness of algorithm. We note that when there are multiple maximal labels among a node neighbors' labels, choosing a node' label from which there is a local cycle to the node instead of a random node' label can avoid the labels propagating among communities at random. In this paper, an improved LPA based on local cycles is given. We have evaluated the proposed algorithm on computer-generated networks with planted partition and some real-world networks whose community structure are already known. The result shows that the performance of the proposed approach is even significantly improved.
APA, Harvard, Vancouver, ISO, and other styles
39

Barbosa, Eduardo Fernandes, Fernando Javier Molina, Flavio Marques Lopes, Pedro Antonio García-Ruíz, Samantha Salomão Caramori, and Kátia Flávia Fernandes. "Immobilization of Peroxidase onto Magnetite Modified Polyaniline." Scientific World Journal 2012 (2012): 1–5. http://dx.doi.org/10.1100/2012/716374.

Full text
Abstract:
The present study describes the immobilization of horseradish peroxidase (HRP) on magnetite-modified polyaniline (PANImG) activated with glutaraldehyde. After the optimization of the methodology, the immobilization of HRP on PANImG produced the same yield (25%) obtained for PANIG with an efficiency of 100% (active protein). The optimum pH for immobilization was displaced by the effect of the partition of protons produced in the microenvironment by the magnetite. The tests of repeated use have shown that PANImG-HRP can be used for 13 cycles with maintenance of 50% of the initial activity.
APA, Harvard, Vancouver, ISO, and other styles
40

Szewczuk-Krypa, Natalia, Anna Grzymkowska, and Jerzy Głuch. "Comparative Analysis of Thermodynamic Cycles of Selected Nuclear Ship Power Plants With High-Temperature Helium-Cooled Nuclear Reactor." Polish Maritime Research 25, s1 (2018): 218–24. http://dx.doi.org/10.2478/pomr-2018-0045.

Full text
Abstract:
Abstract This paper presents a comparative analysis of thermodynamic cycles of two ship power plant systems with a high-temperature helium-cooled nuclear reactor. The first of them is a gas system with recuperator, in which classical gas chamber is substituted for a HTGR reactor (High Temperature Gas-cooled Reactor). The second of the considered cycles is a combined gas-steam system where working medium flux from gas turbine outlet is directed into waste heat boiler and its heat is utilized for production of superheated steam to drive steam turbine. Preliminary calculations of the combine cycles showed that it is necessary to expand the system by adding to its steam part an inter-stage overheat for secondary steam, owing to that a required degree of steam dryness at outlet from the turbine can be reached, ensuring its correct operational conditions. The analyzed power systems were compared to each other with regard to efficiency of their thermodynamic cycles. Also, efficiency of particular cycles were subjected to optimization in respect to such parameters as : working gas temperature at outlet from reactor in gas system as well as steam pressure at outlet from waste heat boiler and partition pressure in steam part of combined system. Advantages of nuclear power plants compared with the classical power systems dominating currently in sea transport were also discussed.
APA, Harvard, Vancouver, ISO, and other styles
41

Skoda, Alexandre. "Convexity of graph-restricted games induced by minimum partitions." RAIRO - Operations Research 53, no. 3 (2019): 841–66. http://dx.doi.org/10.1051/ro/2017069.

Full text
Abstract:
We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the sub-components corresponding to a minimum partition. This minimum partition 𝒫min is i nduced by the deletion of the minimum weight edges. We provide five necessary conditions on the graph edge-weights to have inheritance of convexity from the underlying game to the restricted game associated with 𝒫min. Then, we establish that these conditions are also sufficient for a weaker condition, called ℱ-convexity, obtained by restriction of convexity to connected subsets. Moreover, we prove that inheritance of convexity for Myerson restricted game associated with a given graph G is equivalent to inheritance of ℱ-convexity for the 𝒫min-restricted game associated with a particular weighted graph G′ built from G by adding a dominating vertex, and with only two different edge-weights. Then, we prove that G is cycle-complete if and only if a specific condition on adjacent cycles is satisfied on G′.
APA, Harvard, Vancouver, ISO, and other styles
42

Sierra, Johnny, Daphne Der-Fen Liu, and Jessica Toy. "Antimagic Labeling of Forests." PUMP Journal of Undergraduate Research 6 (August 17, 2023): 268–79. http://dx.doi.org/10.46787/pump.v6i0.3752.

Full text
Abstract:
An antimagic labeling of a graph G(V,E) is a bijection f mapping from E to the set {1,2,…, |E|}, so that for any two different vertices u and v, the sum of f(e) over all edges e incident to u, and the sum of f(e) over all edges e incident to v, are distinct. We call G antimagic if it admits an antimagic labeling. A forest is a graph without cycles; equivalently, every component of a forest is a tree.
 It was proved by Kaplan, Lev, and Roditty in 2009, and by Liang, Wong, and Zhu in 2014 that every tree with at most one vertex of degree two is antimagic. A major tool used in the proof is the zero-sum partition introduced by Kaplan, Lev, and Roditty in 2009. In this article, we provide an algorithmic representation for the zero-sum partition method and apply this method to show that every forest with at most one vertex of degree two is also antimagic.
APA, Harvard, Vancouver, ISO, and other styles
43

BAEZ, JOHN, and MIKE STAY. "Algorithmic thermodynamics." Mathematical Structures in Computer Science 22, no. 5 (2012): 771–87. http://dx.doi.org/10.1017/s0960129511000521.

Full text
Abstract:
Algorithmic entropy can be viewed as a special case of the entropy studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In particular, suppose we fix a universal prefix-free Turing machine and let X be the set of programs that halt for this machine. Then we can regard X as a set of ‘microstates’, and treat any function on X as an ‘observable’. For any collection of observables, we can study the Gibbs ensemble that maximises entropy subject to constraints on the expected values of these observables. We illustrate this by taking the log runtime, length and output of a program as observables analogous to the energy E, volume V and number of molecules N in a container of gas. The conjugate variables of these observables allow us to define quantities we call the ‘algorithmic temperature’ T, ‘algorithmic pressure’ P and ‘algorithmic potential’ μ, since they are analogous to the temperature, pressure and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS − PdV + μdN, and use it to study thermodynamic cycles analogous to those for heat engines. We also investigate the values of T, P and μ for which the partition function converges. At some points on the boundary of this domain of convergence, the partition function becomes uncomputable – indeed, at these points the partition function itself has non-trivial algorithmic entropy.
APA, Harvard, Vancouver, ISO, and other styles
44

Siddiqui, Muhammad Kamran, Yu-Ming Chu, Muhammad Nasir, and Murat Cancan. "On analysis of thermodynamic properties of cuboctahedral bi-metallic structure." Main Group Metal Chemistry 44, no. 1 (2021): 117–28. http://dx.doi.org/10.1515/mgmc-2021-0014.

Full text
Abstract:
Abstract Porous materials, for example, metalnatural structures (MOFs) and their discrete partners metalnatural polyhedra (MOPs), that are built from coordinatively unsaturated inorganic hubs show incredible potential for application in gas adsorption/partition cycles, catalysis, and arising openings in hardware, optics, detecting, and biotechnology. A well-known hetero-bimetallic metalorganic polyhedra of this discrete partners metalnatural polyhedra (MOPs) class is cuboctahedral bi-metallic stricture. In this paper, we discuss the stricture of Hetero-bimetallic metalorganic polyhedra (cuboctahedral bi-metallic). Also, we computed the topological indices based on the degree of atoms in this cuboctahedral bi-metallic structure.
APA, Harvard, Vancouver, ISO, and other styles
45

Avrutin, Viktor, Christoph Dibak, Arianna Dal Forno, and Ugo Merlone. "Dynamics of a 2D Piecewise Linear Braess Paradox Model: Effect of the Third Partition." International Journal of Bifurcation and Chaos 25, no. 11 (2015): 1530031. http://dx.doi.org/10.1142/s0218127415300311.

Full text
Abstract:
In this work, we investigate the dynamics of a piecewise linear 2D discontinuous map modeling a simple network showing the Braess paradox. This paradox represents an example in which adding a new route to a specific congested transportation network makes all the travelers worse off in terms of their individual travel time. In the particular case in which the modeled network corresponds to a binary choice situation, the map is defined on two partitions and its dynamics has already been described. In the general case corresponding to a ternary choice, a third partition appears leading to significantly more complex bifurcation structures formed by border collision bifurcations of stable cycles with points located in all three partitions. Considering a map taking a constant value on one of the partitions, we provide a first systematic description of possible dynamics for this case.
APA, Harvard, Vancouver, ISO, and other styles
46

Vyrovoy, Valery, Oksana Korobko, Vladimir Sukhanov, and Yuri Zakorchemny. "Resistance of concrete and expanded clay concrete under periodic external influences." MATEC Web of Conferences 230 (2018): 03021. http://dx.doi.org/10.1051/matecconf/201823003021.

Full text
Abstract:
The purpose of the work is to increase resistance of concrete in conditions of multiple freezing-thawing and wetting-drying cycles. An important property of concrete is its ability to adapt to the periodical effect of external factors by self-organization of the structure. It assumes the presence at the material of active elements capable of changing their parameters adequately to impacts. Such elements include cracks and inner surfaces of partition as integral elements of the structure of any material. Sets of active elements can be to obtained by directing the structural organization of concrete. The operating factor of structure formation can be a change in the ratio of adhesion and cohesive bonding forces at the surface of partition between the matrix material and the fillers. Concrete the structure of which was initiated by selective adhesion of a matrix to the surface of fillers differed in the raised values of properties. Structural potential has determined resistance of concrete at freezing-thawing and wetting-drying. Sets of active elements of concrete structure are the factors of safe functioning of building constructions in conditions of influence of the operating environment.
APA, Harvard, Vancouver, ISO, and other styles
47

Čibej, Uroš, Luka Fürst, and Jurij Mihelič. "A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms." Symmetry 11, no. 10 (2019): 1300. http://dx.doi.org/10.3390/sym11101300.

Full text
Abstract:
We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equivalence and an optimization problem with the goal of finding an equivalence partition with the highest pruning potential. We also position the optimization problem into the computational-complexity hierarchy. In particular, we show that the verifier lies between P and NP -complete problems. Striving for a practical usability of the approach, we devise a heuristic method for general graphs and optimal algorithms for trees and cycles.
APA, Harvard, Vancouver, ISO, and other styles
48

Podolak, Marian, Dariusz Mana, and Stanislaw Przestalski. "ESR Study of the Liposome Membrane Physical Parameters in the Heating-Cooling Cycles." Zeitschrift für Naturforschung C 53, no. 3-4 (1998): 191–96. http://dx.doi.org/10.1515/znc-1998-3-408.

Full text
Abstract:
Abstract Changes of dynamic and structural parameters of egg yolk lecithin (EYL) liposome mem­branes in the heating-cooling cycles have been studied using the E S R spin probe method. The investigations were conducted in the range of temperatures from -18 °C to +60 °C. It has been found that in the range of temperatures -15 °C to +45 °C in both the heating and the cooling run the spectroscopic parameters changed practically along the same curve (re­versible changes). However, after exceeding this range of temperatures one of the parameters (partition coefficient of the spin probe 2,2,6,6 -tetramethylpiperidine -1-oxyl; TEMPO) changed along a closed curve, showing the phenomenon of thermal hysteresis. In the heating process the TEMPO content in liposome membranes was smaller than this in the cooling process. We assume that during the heating, the lipid molecules of the outer liposome layers dissolve in the aqueous medium. In the cooling process they can aggregate and form new liposomes, what in turn increases the surface of liposome membranes, accessible for the TEMPO probe (active surface).
APA, Harvard, Vancouver, ISO, and other styles
49

Huang, Rongsheng, and Jinzhi Lei. "Dynamics of gene expression with positive feedback to histone modifications at bivalent domains." International Journal of Modern Physics B 32, no. 07 (2018): 1850075. http://dx.doi.org/10.1142/s0217979218500753.

Full text
Abstract:
Experiments have shown that in embryonic stem cells, the promoters of many lineage-control genes contain “bivalent domains”, within which the nucleosomes possess both active (H3K4me3) and repressive (H3K27me3) marks. Such bivalent modifications play important roles in maintaining pluripotency in embryonic stem cells. Here, to investigate gene expression dynamics when there are regulations in bivalent histone modifications and random partition in cell divisions, we study how positive feedback to histone methylation/demethylation controls the transition dynamics of the histone modification patterns along with cell cycles. We constructed a computational model that includes dynamics of histone marks, three-stage chromatin state transitions, transcription and translation, feedbacks from protein product to enzymes to regulate the addition and removal of histone marks, and the inheritance of nucleosome state between cell cycles. The model reveals how dynamics of both nucleosome state transition and gene expression are dependent on the enzyme activities and feedback regulations. Results show that the combination of stochastic histone modification at each cell division and the deterministic feedback regulation work together to adjust the dynamics of chromatin state transition in stem cell regenerations.
APA, Harvard, Vancouver, ISO, and other styles
50

Pittel, Boris. "On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm." Combinatorics, Probability and Computing 2, no. 1 (1993): 53–92. http://dx.doi.org/10.1017/s0963548300000481.

Full text
Abstract:
In a set of even cardinality n, each member ranks all the others in order of preference. A stable matching is a partition of the set into n/2 pairs, with the property that no two unpaired members both prefer each other to their partners under matching. It is known that for some problem instances no stable matching exists. In 1985, Irving found an O(n2) two-phase algorithm that would determine, for any instance, whether a stable matching exists, and if so, would find such a matching. Recently, Tan proved that Irving's algorithm, with a modified second phase, always finds a stable cyclic partition of the members set, which is a stable matching when each cycle has length two. In this paper we study a likely behavior of the algorithm under the assumption that an instance of the ranking system is chosen uniformly at random. We prove that the likely number of basic steps, i.e. the individual proposals in the first phase and the rotation eliminations, involving subsets of members in the second phase, is O(n log n), and that the likely size of a rotation is O((n log n)1/2). We establish a ‘hyperbola law’ analogous to our past result on stable marriages. It states that at every step of the second phase, the product of the rank of proposers and the rank of proposal holders is asymptotic, in probability, to n3. We show that every stable cyclic partition is likely to be almost a stable matching, in the sense that at most O((n log n)1/2) members can be involved in the cycles of length three or more.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography