Log in

Relevant bibliographies by topics / Structural Combinatorics / Journal articles

Journal articles on the topic 'Structural Combinatorics'

To see the other types of publications on this topic, follow the link: Structural Combinatorics.

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

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 'Structural Combinatorics.'

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

Nesetril, Jaroslav. "ASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use)." Taiwanese Journal of Mathematics 3, no. 4 (December 1999): 381–423. http://dx.doi.org/10.11650/twjm/1500407157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hofri, Micha, Chao Li, and Hosam Mahmoud. "ON THE COMBINATORICS OF BINARY SERIES-PARALLEL GRAPHS." Probability in the Engineering and Informational Sciences 30, no. 2 (March 9, 2016): 244–60. http://dx.doi.org/10.1017/s0269964815000364.

Full text

Abstract:

Binary series-parallel (BSP) graphs have applications in transportation modeling, and exhibit interesting combinatorial properties. This work is limited to the second aspect. The BSP graphs of a given size – measured in edges – are enumerated. Under a uniform probability model, we investigate the asymptotic distribution of the order (number of vertices) and the asymptotic average length of a random walk (under different strategies) of large graphs of the same size. The systematic method throughout is to define the graphs, and the features we evaluate by a structural equation (equivalent to a regular expression). The structural equation is translated into an equation for a generating function, which is then analyzed.

APA, Harvard, Vancouver, ISO, and other styles

3

Bonin, Joseph E., and Anna de Mier. "Lattice path matroids: Structural properties." European Journal of Combinatorics 27, no. 5 (July 2006): 701–38. http://dx.doi.org/10.1016/j.ejc.2005.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hornfeck, Wolfgang. "On the combinatorics of crystal structures: number of Wyckoff sequences of given length." Acta Crystallographica Section A Foundations and Advances 78, no. 2 (February 4, 2022): 149–54. http://dx.doi.org/10.1107/s2053273321013565.

Full text

Abstract:

A formula for the calculation of the number of Wyckoff sequences of a given length is presented, based on the combinatorics of multisets with finite multiplicities and a generating function approach, assuming a certain space-group type and taking into account the number of non-fixed and fixed Wyckoff positions, respectively. The formula is applied to the 44 distinguishable combinatorial types of the 230 space-group types. A comparison is made between the calculated frequencies of occurrence of Wyckoff sequences of given space-group type and length and the observed ones for actual crystal structures, as retrieved from the Pearson's Crystal Data Crystal Structure Database for Inorganic Compounds.

APA, Harvard, Vancouver, ISO, and other styles

5

Abramsky, Samson. "Structure and Power: an Emerging Landscape." Fundamenta Informaticae 186, no. 1-4 (August 30, 2022): 1–26. http://dx.doi.org/10.3233/fi-222116.

Full text

Abstract:

In this paper, we give an overview of some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics. The motivations for this work come from Computer Science, but there may also be something of interest for model theorists and other logicians. The basic setting involves studying the category of relational structures via a resource-indexed family of adjunctions with some process category - which unfolds relational structures into tree-like forms, allowing natural resource parameters to be assigned to these unfoldings. One basic instance of this scheme allows us to recover, in a purely structural, syntax-free way: the Ehrenfeucht-Fraïssé game; the quantifier rank fragments of first-order logic; the equivalences on structures induced by (i) the quantifier rank fragments, (ii) the restriction of this fragment to the existential positive part, and (iii) the extension with counting quantifiers; and the combinatorial parameter of tree-depth (Nesetril and Ossona de Mendez). Another instance recovers the k-pebble game, the finite-variable fragments, the corresponding equivalences, and the combinatorial parameter of treewidth. Other instances cover modal, guarded and hybrid fragments, generalized quantifiers, and a wide range of combinatorial parameters. This whole scheme has been axiomatized in a very general setting, of arboreal categories and arboreal covers. Beyond this basic level, a landscape is beginning to emerge, in which structural features of the resource categories, adjunctions and comonads are reflected in degrees of logical and computational tractability of the corresponding languages. Examples include semantic characterisation and preservation theorems, and Lovász-type results on counting homomorphisms.

APA, Harvard, Vancouver, ISO, and other styles

6

Bowman, Chris, Anton Cox, Amit Hazi, and Dimitris Michailidis. "Path combinatorics and light leaves for quiver Hecke algebras." Mathematische Zeitschrift 300, no. 3 (September 29, 2021): 2167–203. http://dx.doi.org/10.1007/s00209-021-02829-0.

Full text

Abstract:

AbstractWe recast the classical notion of “standard tableaux" in an alcove-geometric setting and extend these classical ideas to all “reduced paths" in our geometry. This broader path-perspective is essential for implementing the higher categorical ideas of Elias–Williamson in the setting of quiver Hecke algebras. Our first main result is the construction of light leaves bases of quiver Hecke algebras. These bases are richer and encode more structural information than their classical counterparts, even in the case of the symmetric groups. Our second main result provides path-theoretic generators for the “Bott–Samelson truncation" of the quiver Hecke algebra.

APA, Harvard, Vancouver, ISO, and other styles

7

Mykytenko, Victoriia, and Nataliia Sheludko. "Control of sustainable management according to multilevel combinatorics of homeostatic mechanisms." E3S Web of Conferences 255 (2021): 01029. http://dx.doi.org/10.1051/e3sconf/202125501029.

Full text

Abstract:

The article aims to develop the methodological base for study and substantiation of homeostatic mechanisms of control of stability of managing systems in the conditions which is implemented according to the sustainable management concept. The article describes features of main types of homeostasis of managing systems (evolutionary, structural, resistant, system homeostasis), their hierarchical closed interrelation and inherent specific and predictive administrative properties. The following is herein substantiated: conditions of homeostasis generation and realization of specific effect of mechanisms and, respectively, regulators of adaptation of managing systems to external and internal transformations; directions and methods to form resistant, to institutional and resource restrictions, complementary managing complexes. The article states that the combinatorics of homeostasis controls includes stabilizing, inertial, adaptation, organizational and economic, kinematic, cybernetic, alarm, cognitive information, reparative, regenerative and other types of controls. It emphasizes that the complex of mechanisms to ensure self-regulating properties of systems must be focused on support of their adaptation abilities to external and internal transformations. Taking into account four-level structural hierarchy of homeostatic properties, the article substantiates the possibility of ensuring adequate design of regulators for their consolidation according to priority objects of tools and events localization.

APA, Harvard, Vancouver, ISO, and other styles

8

Rao, S. B., U. K. Sahoo, and V. Parameswaran. "Cycle stochastic graphs: Structural and forbidden graph characterizations." AKCE International Journal of Graphs and Combinatorics 17, no. 3 (April 21, 2020): 1076–80. http://dx.doi.org/10.1016/j.akcej.2020.01.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Krüger, Ulrich. "Structural aspects of ordered polymatroids." Discrete Applied Mathematics 99, no. 1-3 (February 2000): 125–48. http://dx.doi.org/10.1016/s0166-218x(99)00129-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nešetřil, Jaroslav. "Structural Properties of Sparse Graphs." Electronic Notes in Discrete Mathematics 31 (August 2008): 247–51. http://dx.doi.org/10.1016/j.endm.2008.06.050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mašulović, Dragan. "Canonizing structural Ramsey theorems." Discrete Mathematics 342, no. 3 (March 2019): 747–59. http://dx.doi.org/10.1016/j.disc.2018.11.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Krnc, Matjaž, Jean-Sébastien Sereni, Riste Škrekovski, and Zelealem B. Yilma. "Eccentricity of networks with structural constraints." Discussiones Mathematicae Graph Theory 40, no. 4 (2020): 1141. http://dx.doi.org/10.7151/dmgt.2180.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Mojallal, Seyed Ahmad, Ji-Hwan Jung, Gi-Sang Cheon, Suh-Ryung Kim, and Bumtle Kang. "Structural properties of Toeplitz graphs." Discrete Mathematics 345, no. 11 (November 2022): 113016. http://dx.doi.org/10.1016/j.disc.2022.113016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Beben, Piotr, and Jelena Grbić. "LS-category of moment-angle manifolds and higher order Massey products." Forum Mathematicum 33, no. 5 (August 26, 2021): 1179–205. http://dx.doi.org/10.1515/forum-2021-0015.

Full text

Abstract:

Abstract Using the combinatorics of the underlying simplicial complex K, we give various upper and lower bounds for the Lusternik–Schnirelmann (LS) category of moment-angle complexes 𝒵 K {\mathcal{Z}_{K}} . We describe families of simplicial complexes and combinatorial operations which allow for a systematic description of the LS-category. In particular, we characterize the LS-category of moment-angle complexes 𝒵 K {\mathcal{Z}_{K}} over triangulated d-manifolds K for d ≤ 2 {d\leq 2} , as well as higher-dimensional spheres built up via connected sum, join, and vertex doubling operations. We show that the LS-category closely relates to vanishing of Massey products in H * ⁢ ( 𝒵 K ) {H^{*}(\mathcal{Z}_{K})} , and through this connection we describe first structural properties of Massey products in moment-angle manifolds. Some of the further applications include calculations of the LS-category and the description of conditions for vanishing of Massey products for moment-angle manifolds over fullerenes, Pogorelov polytopes and k-neighborly complexes, which double as important examples of hyperbolic manifolds.

APA, Harvard, Vancouver, ISO, and other styles

15

Oliveira, Regilene, and Yulin Zhao. "Structural Stability of Planar Quasihomogeneous Vector Fields." Qualitative Theory of Dynamical Systems 13, no. 1 (December 21, 2013): 39–72. http://dx.doi.org/10.1007/s12346-013-0105-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Kratochvíl, Jan, Andrzej Proskurowski, and Oriol Serra. "Structural decompositions, width parameters, and graph labelings." Discrete Applied Mathematics 145, no. 2 (January 2005): 141–42. http://dx.doi.org/10.1016/j.dam.2004.08.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Cheng, Eddie, Marc J. Lipman, and László Lipták. "Strong structural properties of unidirectional star graphs." Discrete Applied Mathematics 156, no. 15 (August 2008): 2939–49. http://dx.doi.org/10.1016/j.dam.2007.12.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chandrasekaran, R., and M. Dawande. "Structural analysis of a fractional matching problem." Discrete Applied Mathematics 157, no. 18 (November 2009): 3708–20. http://dx.doi.org/10.1016/j.dam.2009.07.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Estrada, Ernesto. "Rethinking structural balance in signed social networks." Discrete Applied Mathematics 268 (September 2019): 70–90. http://dx.doi.org/10.1016/j.dam.2019.04.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Champseix, Nicolas, Esther Galby, Andrea Munaro, and Bernard Ries. "CPG graphs: Some structural and hardness results." Discrete Applied Mathematics 290 (February 2021): 17–35. http://dx.doi.org/10.1016/j.dam.2020.11.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Rosenberg, I. G. "Structural rigidity II: Almost infinitesimally rigid bar frameworks." Discrete Applied Mathematics 13, no. 1 (January 1986): 41–59. http://dx.doi.org/10.1016/0166-218x(86)90068-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Abreu, Nair Maria Maia de, Claudia Marcela Justel, Lilian Markenzon, Carla Silva Oliveira, and Christina Fraga Esteves Maciel Waga. "Block-indifference graphs: Characterization, structural and spectral properties." Discrete Applied Mathematics 269 (September 2019): 60–67. http://dx.doi.org/10.1016/j.dam.2018.11.034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Balasubramanian, Krishnan. "Mathematical and Computational Techniques for Drug Discovery: Promises and Developments." Current Topics in Medicinal Chemistry 18, no. 32 (March 5, 2019): 2774–99. http://dx.doi.org/10.2174/1568026619666190208164005.

Full text

Abstract:

We review various mathematical and computational techniques for drug discovery exemplifying some recent works pertinent to group theory of nested structures of relevance to phylogeny, topological, computational and combinatorial methods for drug discovery for multiple viral infections. We have reviewed techniques from topology, combinatorics, graph theory and knot theory that facilitate topological and mathematical characterizations of protein-protein interactions, molecular-target interactions, proteomics, genomics and statistical data reduction procedures for a large set of starting chemicals in drug discovery. We have provided an overview of group theoretical techniques pertinent to phylogeny, protein dynamics especially in intrinsically disordered proteins, DNA base permutations and related algorithms. We consider computational techniques derived from high level quantum chemical computations such as QM/MM ONIOM methods, quantum chemical optimization of geometries complexes, and molecular dynamics methods for providing insights into protein-drug interactions. We have considered complexes pertinent to Hepatitis Virus C non-structural protein 5B polymerase receptor binding of C5-Arylidebne rhodanines, complexes of synthetic potential vaccine molecules with dengue virus (DENV) and HIV-1 virus as examples of various simulation studies that exemplify the utility of computational tools. It is demonstrated that these combinatorial and computational techniques in conjunction with experiments can provide promising new insights into drug discovery. These techniques also demonstrate the need to consider a new multiple site or allosteric binding approach to drug discovery, as these studies reveal the existence of multiple binding sites.

APA, Harvard, Vancouver, ISO, and other styles

24

Schiermeyer, Ingo, Martin Sonntag, and Hanns-Martin Teichert. "Structural Properties and Hamiltonicity of Neighborhood Graphs." Graphs and Combinatorics 26, no. 3 (March 2, 2010): 433–56. http://dx.doi.org/10.1007/s00373-010-0909-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bevan, David, Robert Brignall, Andrew Elvey Price, and Jay Pantone. "A structural characterisation of Av(1324) and new bounds on its growth rate." European Journal of Combinatorics 88 (August 2020): 103115. http://dx.doi.org/10.1016/j.ejc.2020.103115.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Beal, Richard, and Donald A. Adjeroh. "The structural border array." Journal of Discrete Algorithms 23 (November 2013): 98–112. http://dx.doi.org/10.1016/j.jda.2013.07.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Sheng, Huiyu, and Yingqian Wang. "A structural theorem for planar graphs with some applications." Discrete Applied Mathematics 159, no. 11 (July 2011): 1183–87. http://dx.doi.org/10.1016/j.dam.2011.03.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Mezník, Ivan. "On some structural properties of a subclass of ∞-regular languages." Discrete Applied Mathematics 18, no. 3 (December 1987): 315–19. http://dx.doi.org/10.1016/s0166-218x(87)80007-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Aldred, Robert E. L., Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, and Brendan D. McKay. "Graph structural properties of non-Yutsis graphs allowing fast recognition." Discrete Applied Mathematics 157, no. 2 (January 2009): 377–86. http://dx.doi.org/10.1016/j.dam.2008.03.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Lacroix, Mathieu, A. Ridha Mahjoub, and Sébastien Martin. "Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets." Electronic Notes in Discrete Mathematics 36 (August 2010): 1073–80. http://dx.doi.org/10.1016/j.endm.2010.05.136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Griffing, Alexander R., Benjamin R. Lynch, and Eric A. Stone. "Structural properties of the minimum cut of partially-supplied graphs." Discrete Applied Mathematics 177 (November 2014): 152–57. http://dx.doi.org/10.1016/j.dam.2014.05.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Che, Zhongyuan. "Structural properties of resonance graphs of plane elementary bipartite graphs." Discrete Applied Mathematics 247 (October 2018): 102–10. http://dx.doi.org/10.1016/j.dam.2018.03.065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Katsikarelis, Ioannis, Michael Lampis, and Vangelis Th Paschos. "Structural parameters, tight bounds, and approximation for (k,r)-center." Discrete Applied Mathematics 264 (July 2019): 90–117. http://dx.doi.org/10.1016/j.dam.2018.11.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Barahona, Pedro, and Ludwig Krippahl. "Constraint Programming in Structural Bioinformatics." Constraints 13, no. 1-2 (March 15, 2008): 3–20. http://dx.doi.org/10.1007/s10601-007-9036-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Dăscălescu, S., M. C. Iovanov, and S. Preduţ. "Frobenius structural matrix algebras." Linear Algebra and its Applications 439, no. 10 (November 2013): 3166–72. http://dx.doi.org/10.1016/j.laa.2013.09.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Hoffmann, Arne, and Lutz Volkmann. "Structural Remarks on Bipartite Graphs with Unique f-Factors." Graphs and Combinatorics 21, no. 4 (December 2005): 421–25. http://dx.doi.org/10.1007/s00373-005-0631-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Nakamura, Masataka. "Structural theorems for submodular functions, polymatroids and polymatroid intersections." Graphs and Combinatorics 4, no. 1 (December 1988): 257–84. http://dx.doi.org/10.1007/bf01864166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Dimitrov, Darko. "On structural properties of trees with minimal atom-bond connectivity index." Discrete Applied Mathematics 172 (July 2014): 28–44. http://dx.doi.org/10.1016/j.dam.2014.03.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

OHIIENKO, Alona. "Combinatorics of methodologies for determining the efficiency of tourist potential assessment." Actual problems of innovative economy, no. 2020/2 (May 28, 2020): 90–94. http://dx.doi.org/10.36887/2524-0455-2020-2-16.

Full text

Abstract:

Introduction. The materials of the article outline that when analyzing the efficiency of the use of tourist and recrea-tional potential, as a rule, not all-important structural components and features of their manifestation and reproduction are taken into account. This leads to incomplete and inaccurate quantitative and qualitative diagnostics, analysis and modeling and requires in-depth development. The purpose of this article is to substantiate the process of determining the structure of the methodological approach to assessing the efficiency of the tourist potential of the region. Realization of the set purpose is reached by the decision of such tasks: step-by-step processes of definition of efficiency of tourist potential, to formalize process and to construct algo-rithm of definition of efficiency of use of tourist and recreational objects and territories. Results. Taking into account the considered researches, we propose to carry out definition of efficiency of use of tour-ist and recreational potential in three stages: a preparatory stage of identification and monitoring; stage of data ordering and actual assessment; stage of analysis of results, obtaining conclusions and their further interpretation. The proposed compre-hensive methodology for studying the efficiency of tourist and recreational potential of the region, which is based on a con-sistent combination of different methodological approaches, tools and techniques will formalize this process and build an algorithm for determining the efficiency of tourist and recreational facilities and areas. Conclusions. It is proposed to determine the efficiency of the use of tourist and recreational potential in three stages: the preparatory stage of identification and monitoring; stage of data ordering and actual assessment; stage of analysis of results. Based on the existing approaches, an algorithm for a comprehensive study of the efficiency of the use of tourist and recreational facilities and areas is proposed. Key words: tourist potential, efficiency assessment, research methodology, algorithm, research stages.

APA, Harvard, Vancouver, ISO, and other styles

40

Choudum, S. A., T. Karthick, and Manoj M. Belavadi. "Structural domination and coloring of some (P7,C7)-free graphs." Discrete Mathematics 344, no. 3 (March 2021): 112244. http://dx.doi.org/10.1016/j.disc.2020.112244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Kutnar, Klavdija, and Paweł Petecki. "On automorphisms and structural properties of double generalized Petersen graphs." Discrete Mathematics 339, no. 12 (December 2016): 2861–70. http://dx.doi.org/10.1016/j.disc.2016.05.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Hoang Nguyen, Minh, and Mirka Miller. "Structural properties of graphs of diameter 2 with maximal repeats." Discrete Mathematics 308, no. 11 (June 2008): 2337–41. http://dx.doi.org/10.1016/j.disc.2006.09.057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Bacsó, Gábor. "Complete description of forbidden subgraphs in the structural domination problem." Discrete Mathematics 309, no. 8 (April 2009): 2466–72. http://dx.doi.org/10.1016/j.disc.2008.05.053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Ando, Kiyoshi, and Qin Chengfu. "Some structural properties of minimally contraction-critically 5-connected graphs." Discrete Mathematics 311, no. 13 (July 2011): 1084–97. http://dx.doi.org/10.1016/j.disc.2010.10.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Huang, Jing Lian, Chun Ling Zhang, and Ya Jing Liu. "Some Cryptographic Properties of Rotation Symmetric Boolean Functions." Applied Mechanics and Materials 321-324 (June 2013): 2704–7. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2704.

Full text

Abstract:

Using the derivative of H Boolean functions and the e-derivativedefined by the authors as the research tools, we go deep into the internal structure of the Booleanfunction values, additionally,by the methods of cascade calculations and analytic combinatorics, cryptographic properties such as structural features, existence,balance and algebraic immunity of rotation symmetric H Boolean functions withdiffusibility are studied. Then we get the results that the Second Order rotation symmetric Boolean functionsare H Boolean functions,andthe results to the issues such asthe balance and algebraic immunity of rotation symmetric H Boolean functionsand the existence of the Third Order symmetric H Boolean functions are also be established.

APA, Harvard, Vancouver, ISO, and other styles

46

Hernando, Carmen, Mercè Mora, Ignacio M. Pelayo, and Carlos Seara. "Some structural, metric and convex properties on the boundary of a graph." Electronic Notes in Discrete Mathematics 24 (July 2006): 203–9. http://dx.doi.org/10.1016/j.endm.2006.06.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kubica, Marcin, Romeo Rizzi, Stéphane Vialette, and Tomasz Waleń. "Approximation of RNA multiple structural alignment." Journal of Discrete Algorithms 9, no. 4 (December 2011): 365–76. http://dx.doi.org/10.1016/j.jda.2010.03.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Cheon, Gi-Sang, Ji-Hwan Jung, Sergey Kitaev, and Seyed Ahmad Mojallal. "Riordan graphs I: Structural properties." Linear Algebra and its Applications 579 (October 2019): 89–135. http://dx.doi.org/10.1016/j.laa.2019.05.033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Vuskovic, Kristina. "Even-hole-free graphs: A survey." Applicable Analysis and Discrete Mathematics 4, no. 2 (2010): 219–40. http://dx.doi.org/10.2298/aadm100812027v.

Full text

Abstract:

The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, which was the key initial motivation for their study. The techniques developed in the study of even-hole-free graphs were generalized to other complex hereditary graph classes, and in the case of perfect graphs led to the famous resolution of the Strong Perfect Graph Conjecture and their polynomial time recognition. The class of even-holefree graphs is also of independent interest due to its relationship to ?-perfect graphs. In this survey we describe all the different structural characterizations of even-hole-free graphs, focusing on their algorithmic consequences.

APA, Harvard, Vancouver, ISO, and other styles

50

Meddaugh, Jonathan. "Shadowing as a structural property of the space of dynamical systems." Discrete & Continuous Dynamical Systems 42, no. 5 (2022): 2439. http://dx.doi.org/10.3934/dcds.2021197.

Full text

Abstract:

<p style='text-indent:20px;'>We demonstrate that there is a large class of compact metric spaces for which the shadowing property can be characterized as a structural property of the space of dynamical systems. We also demonstrate that, for this class of spaces, in order to determine whether a system has shadowing, it is sufficient to check that <i>continuously generated</i> pseudo-orbits can be shadowed.</p>

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!