Log in

Relevant bibliographies by topics / Structural characterization of families of graphs

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Structural characterization of families of graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 14 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Structural characterization of families of graphs.'

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.

Journal articles on the topic "Structural characterization of families of graphs"

1

WIEDERMANN, JIŘÍ, and DANA PARDUBSKÁ. "WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY." International Journal of Foundations of Computer Science 19, no. 04 (2008): 887–913. http://dx.doi.org/10.1142/s0129054108006029.

Full text

Abstract:

The Wireless Parallel Turing Machine (WPTM) is a new computational model recently introduced and studied by the authors. Its design captures important features of wireless mobile computing. In this paper we survey some results related to the descriptive complexity aspects of the new model. In particular, we show a tight relationship about (a) wireless parallel computing, (b) alternating, and (c) synchronized alternating Turing machines. This relationship opens, e.g., the road to circuit complexity by offering an elegant WPTM characterization of bounded-fan-in uniform circuit families, such as

APA, Harvard, Vancouver, ISO, and other styles

2

Anđelić, Milica, and Domingos M. Cardoso. "Spectral Characterization of Families of Split Graphs." Graphs and Combinatorics 31, no. 1 (2013): 59–72. http://dx.doi.org/10.1007/s00373-013-1387-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Wenjing, Du Lei, Sarah K. Keedy, et al. "Brain gray matter network organization in psychotic disorders." Neuropsychopharmacology 45, no. 4 (2019): 666–74. http://dx.doi.org/10.1038/s41386-019-0586-2.

Full text

Abstract:

AbstractAbnormal neuroanatomic brain networks have been reported in schizophrenia, but their characterization across patients with psychotic disorders, and their potential alterations in nonpsychotic relatives, remain to be clarified. Participants recruited by the Bipolar and Schizophrenia Network for Intermediate Phenotypes consortium included 326 probands with psychotic disorders (107 with schizophrenia (SZ), 87 with schizoaffective disorder (SAD), 132 with psychotic bipolar disorder (BD)), 315 of their nonpsychotic first-degree relatives and 202 healthy controls. Single-subject gray matter

APA, Harvard, Vancouver, ISO, and other styles

4

Barthelemy, Marc. "From paths to blocks: New measures for street patterns." Environment and Planning B: Urban Analytics and City Science 44, no. 2 (2016): 256–71. http://dx.doi.org/10.1177/0265813515599982.

Full text

Abstract:

The street network is an important aspect of cities and contains crucial information about their organization and evolution. Characterizing and comparing various street networks could then be helpful for a better understanding of the mechanisms governing the formation and evolution of these systems. Their characterization is however not easy: there are no simple tools to classify planar networks and most of the measures developed for complex networks are not useful when space is relevant. Here, we describe recent efforts in this direction and new methods adapted to spatial networks. We will fi

APA, Harvard, Vancouver, ISO, and other styles

5

Revathi, R., and S. Ganesh. "Characterization of certain families of modular multiplicative divisor graphs." Journal of Taibah University for Science 11, no. 2 (2017): 294–97. http://dx.doi.org/10.1016/j.jtusci.2015.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gardiner, A., and Cheryl E. Praeger. "A Characterization of Certain Families of 4-Valent Symmetric Graphs." European Journal of Combinatorics 15, no. 4 (1994): 383–97. http://dx.doi.org/10.1006/eujc.1994.1042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Shahsavari, Hossein, and Behrooz Khosravi. "Characterization of some families of simple groups by their intersection graphs." Communications in Algebra 48, no. 3 (2019): 1266–80. http://dx.doi.org/10.1080/00927872.2019.1682151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Brown, David E., and Breeann M. Flesch. "A Characterization of 2-Tree Proper Interval 3-Graphs." Journal of Discrete Mathematics 2014 (February 23, 2014): 1–7. http://dx.doi.org/10.1155/2014/143809.

Full text

Abstract:

An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three graphs and three infinite families of forbidden induced subgraphs.

APA, Harvard, Vancouver, ISO, and other styles

10

Wong, Felix, Annwesha Dutta, Debashish Chowdhury, and Jeremy Gunawardena. "Structural conditions on complex networks for the Michaelis–Menten input–output response." Proceedings of the National Academy of Sciences 115, no. 39 (2018): 9738–43. http://dx.doi.org/10.1073/pnas.1808053115.

Full text

Abstract:

The Michaelis–Menten (MM) fundamental formula describes how the rate of enzyme catalysis depends on substrate concentration. The familiar hyperbolic relationship was derived by timescale separation for a network of three reactions. The same formula has subsequently been found to describe steady-state input–output responses in many biological contexts, including single-molecule enzyme kinetics, gene regulation, transcription, translation, and force generation. Previous attempts to explain its ubiquity have been limited to networks with regular structure or simplifying parametric assumptions. He

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Structural characterization of families of graphs"

1

Messuti, Silvia [Verfasser], and Mathias [Akademischer Betreuer] Schacht. "Structural properties of dense graphs with high odd girth and packing of minor-closed families of graphs / Silvia Messuti ; Betreuer: Mathias Schacht." Hamburg : Staats- und Universitätsbibliothek Hamburg, 2016. http://d-nb.info/1119320127/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Structural characterization of families of graphs"

1

Bonato, Anthony. The game of cops and robbers on graphs. American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bianconi, Ginestra. Synchronization, Non-linear Dynamics and Control. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198753919.003.0015.

Full text

Abstract:

This chapter is entirely devoted to characterizing non-linear dynamics on multilayer networks. Special attention is given to recent results on the stability of synchronization that extend the Master Stability Function approach to the multilayer networks scenario. Discontinous synchronization transitions on multiplex networks recently reported in the literature are also discussed, and their application discussed in the context of brain networks. This chapter also presents an overview of the major results regarding pattern formation in multilayer networks, and the proposed characterization of mu

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Structural characterization of families of graphs"

1

Pelc, Andrzej. "Explorable Families of Graphs." In Structural Information and Communication Complexity. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01325-7_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Godard, Emmanuel, and Yves Métivier. "A Characterization of Families of Graphs in Which Election Is Possible." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45931-6_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Structural characterization of families of graphs"

1

Klobas, Nina, and Matjaž Krnc. "Fast Recognition of Some Parametric Graph Families." In 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.7.

Full text

Abstract:

Recognizing graphs with high level of symmetries is hard in general, and usually requires additional structural understanding. In this paper we study a particular graph parameter and motivate its usage by devising eÿcient recognition algorithm for the family of I-graphs. For integers m a simple graph is cycle regular if every path of length ` belongs to exactly cycles of length m. We identify all cycle regular I-graphs and, as a conse-quence, describe linear recognition algorithm for the observed family. Similar procedure can be used to devise the recog-nition algorithms for Double generalized

APA, Harvard, Vancouver, ISO, and other styles

2

Boutheyna, Touafchia, Kadi Zahia, Redjaimia Lilia, and Rached-Kanouni Malika. "STRUCTURAL AND FLORISTIC CHARACTERIZATION OF THE OULED BECHIH FOREST (ALGERIA)." In GEOLINKS Conference Proceedings. Saima Consult Ltd, 2021. http://dx.doi.org/10.32008/geolinks2021/b2/v3/22.

Full text

Abstract:

The objective of this study is the rational management of forest ecosystems for sustainable conservation of floristic biodiversity. Two types of analysis are carried out: structural analysis and analysis of the main species. A total of 22 families were identified, divided among 32 species. The dominant woody species are Quercus suber and Quercus canariensis. Fagaceae is the most represented family. The average values of species richness and Shannon diversity index are 4 ± 1.8 and 0.9 ± 0.30 species/plot respectively. The average density of woody species in the Oueld Bechih forest was 158 ± 28

APA, Harvard, Vancouver, ISO, and other styles

3

Tasnádi, Peter, and Peter Nagy. "The world of fractals." In Sixth International Conference on Higher Education Advances. Universitat Politècnica de València, 2020. http://dx.doi.org/10.4995/head20.2020.11178.

Full text

Abstract:

Fractals are fascinating geometric structures of nature which appear in more and more field of science, ranging from heartbeat characterization through, cancer research, stock exchange trends, meteorology, and computer graphics, up to digital image processing. Fractals can be created by simple algorithms that can be manifested with also simple computer programs. The necessary programs are available in the literature and they are easy to understand and manage for first-year undergraduate students too. Therefore fractals are suitable to attract student interest and improve their attitudes toward

APA, Harvard, Vancouver, ISO, and other styles

4

Weffort-Santos, Celso A., Christiane N. Campos, and Rafael C. S. Schouery. "Proper gap-labellings: on the edge and vertex variants." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6343.

Full text

Abstract:

Given a simple graph G, an ordered pair (π, cπ) is said to be a gap- [k]-edge-labelling (resp. gap-[k]-vertex-labelling) ofG ifπ is an edge-labelling (vertex-labelling) on the set {1, . . . , k}, and cπ is a proper vertex-colouring such that every vertex of degree at least two has its colour induced by the largest difference among the labels of its incident edges (neighbours). The decision problems associated with these labellings are NP-complete for k ≥ 3, and even when k = 2 for some classes of graphs. This thesis presents a study of the computational complexity of these problems, structural

APA, Harvard, Vancouver, ISO, and other styles

5

Du, Xuehong, Mitchell M. Tseng, and Jianxin Jiao. "Graph Grammar Based Product Variety Modeling." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/dfm-14041.

Full text

Abstract:

Abstract This paper discusses the issue of product variety modeling, i.e. the means to organize the data of a family of products according to the underpinning logic among them. The targeted product families are characterized by providing user-selectable product features and feature values and achieving variety by combining parameterized functional or physical modules. A graph grammar based (GGB) model is proposed for the purpose of enhancing the comprehensiveness and manipulability of the data of product families for different functional departments in a company in order to facilitate effectiv

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!