Log in

Relevant bibliographies by topics / Graph theory. Sequences (Mathematics)

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Graph theory. Sequences (Mathematics)'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 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 'Graph theory. Sequences (Mathematics).'

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 "Graph theory. Sequences (Mathematics)"

1

Thomas, Nobin, Lisa Mathew, Sastha Sriram, Atulya K. Nagar, and K. G. Subramanian. "Certain Distance-Based Topological Indices of Parikh Word Representable Graphs." Journal of Mathematics 2021 (May 25, 2021): 1–7. http://dx.doi.org/10.1155/2021/5567663.

Full text

Abstract:

Relating graph structures with words which are finite sequences of symbols, Parikh word representable graphs (PWRGs) were introduced. On the other hand, in chemical graph theory, graphs have been associated with molecular structures. Also, several topological indices have been defined in terms of graph parameters and studied for different classes of graphs. In this study, we derive expressions for computing certain topological indices of PWRGs of binary core words, thereby enriching the study of PWRGs.

APA, Harvard, Vancouver, ISO, and other styles

2

ERDŐS, PÉTER L., ISTVÁN MIKLÓS, and ZOLTÁN TOROCZKAI. "New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling." Combinatorics, Probability and Computing 27, no. 2 (2017): 186–207. http://dx.doi.org/10.1017/s0963548317000499.

Full text

Abstract:

In network modelling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in the form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a Joint Degree Matrix. One approach is to use Markov chains based on edge switches (swaps) that preserve the constraints, are irreducible (ergodic) and fast mixing. In 1999, Kannan, Tetali and Vempala (KTV) proposed a simple swap Markov chain for sampli

APA, Harvard, Vancouver, ISO, and other styles

3

Rautiainen, Mikko, Veli Mäkinen, and Tobias Marschall. "Bit-parallel sequence-to-graph alignment." Bioinformatics 35, no. 19 (2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.

Full text

Abstract:

Abstract Motivation Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction and variant calling with respect to a variation graph. Results

APA, Harvard, Vancouver, ISO, and other styles

4

BIDKHORI, HODA, and SHAUNAK KISHORE. "A Bijective Proof of a Theorem of Knuth." Combinatorics, Probability and Computing 20, no. 1 (2010): 11–25. http://dx.doi.org/10.1017/s0963548310000192.

Full text

Abstract:

The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix Tree Theorem to prove a formula for the number of spanning trees of G, and he asked for a bijective proof [6]. In this paper, we give a bijective proof of Knuth's formula. As a result of this proof, we find a bijection between binary de Bruijn sequences of degree n and binary sequences of length 2n−1. Finally, we determine the critical groups of all the Kautz graphs and de Bruijn graphs, generalizing a result of Levine [7].

APA, Harvard, Vancouver, ISO, and other styles

5

Choudum, S. A. "A simple proof of the Erdos-Gallai theorem on graph sequences." Bulletin of the Australian Mathematical Society 33, no. 1 (1986): 67–70. http://dx.doi.org/10.1017/s0004972700002872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Qiu, Yutong, and Carl Kingsford. "Constructing small genome graphs via string compression." Bioinformatics 37, Supplement_1 (2021): i205—i213. http://dx.doi.org/10.1093/bioinformatics/btab281.

Full text

Abstract:

Abstract Motivation The size of a genome graph—the space required to store the nodes, node labels and edges—affects the efficiency of operations performed on it. For example, the time complexity to align a sequence to a graph without a graph index depends on the total number of characters in the node labels and the number of edges in the graph. This raises the need for approaches to construct space-efficient genome graphs. Results We point out similarities in the string encoding mechanisms of genome graphs and the external pointer macro (EPM) compression model. We present a pair of linear-time

APA, Harvard, Vancouver, ISO, and other styles

7

Beyer, Wolfgang, Adam M. Novak, Glenn Hickey, et al. "Sequence tube maps: making graph genomes intuitive to commuters." Bioinformatics 35, no. 24 (2019): 5318–20. http://dx.doi.org/10.1093/bioinformatics/btz597.

Full text

Abstract:

Abstract Motivation Compared to traditional haploid reference genomes, graph genomes are an efficient and compact data structure for storing multiple genomic sequences, for storing polymorphisms or for mapping sequencing reads with greater sensitivity. Further, graphs are well-studied computer science objects that can be efficiently analyzed. However, their adoption in genomic research is slow, in part because of the cognitive difficulty in interpreting graphs. Results We present an intuitive graphical representation for graph genomes that re-uses well-honed techniques developed to display pub

APA, Harvard, Vancouver, ISO, and other styles

8

G. S. Wijesiri, W. W. P. M. T. M. Karunasena,. "Application of Graph Theory in DNA similarity analysis of Evolutionary Closed Species." Psychology and Education Journal 58, no. 1 (2021): 3428–34. http://dx.doi.org/10.17762/pae.v58i1.1282.

Full text

Abstract:

DNA is a complex molecule that consists of biological information that is passed down from generation to generation. With the evolution over time, there are different kinds of species that evolved from a common ancestor because of the occurrence of DNA sequence rearrangements. DNA sequence similarity analysis is a major challenge since the number of sequences is rapidly increasing in the DNA database. In this research, we based a mathematical method to analyze the similarity of two DNA sequences using Graph Theory. This mathematical method started by modeling a weighted directed graph for each

APA, Harvard, Vancouver, ISO, and other styles

9

Cvetkovic, Dragos. "Spectral recognition of graphs." Yugoslav Journal of Operations Research 22, no. 2 (2012): 145–61. http://dx.doi.org/10.2298/yjor120925025c.

Full text

Abstract:

At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra. Very quickly this conjecture was refuted and numerous examples and families of non-isomorphic graphs with the same spectrum (cospectral graphs) were found. Still some graphs are characterized by their spectra and several mathematical papers are devoted to this topic. In applications to computer sciences, spectral graph theory is considered as very strong. The benefit of using graph spectra in treating graphs is that

APA, Harvard, Vancouver, ISO, and other styles

10

HEFETZ, DAN, and MYKHAYLO TYOMKYN. "Universality of Graphs with Few Triangles and Anti-Triangles." Combinatorics, Probability and Computing 25, no. 4 (2015): 560–76. http://dx.doi.org/10.1017/s0963548315000188.

Full text

Abstract:

We study 3-random-likegraphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph$\mathcal{G}$n,1/2is, in particular, 3-random-like, this can be viewed as a weak version of quasi-randomness. We first show that 3-random-like graphs are 4-universal, that is, they contain induced copies of all 4-vertex graphs. This settles a question of Linial and Morgenstern [10]. We then show that for larger subgraphs, 3-random-like sequences demonstrate completely different behaviour. We prove that for every graphHonn⩾ 13 vertices there ex

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graph theory. Sequences (Mathematics)"

1

Przytycka, Teresa Maria. "Parallel techniques for construction of trees and related problems." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/30640.

Full text

Abstract:

The concept of a tree has been used in various areas of mathematics for over a century. In particular, trees appear to be one of the most fundamental notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods which seem to be inherently sequential. One of the contributions of this thesis is the introduction of several parallel techniques for the construction of various types of trees and the presentation of new parallel tree construction algorithms using these methods. Along with the parallel tree const

APA, Harvard, Vancouver, ISO, and other styles

2

Meyer, Marie. "Polytopes Associated to Graph Laplacians." UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/54.

Full text

Abstract:

Graphs provide interesting ways to generate families of lattice polytopes. In particular, one can use matrices encoding the information of a finite graph to define vertices of a polytope. This dissertation initiates the study of the Laplacian simplex, PG, obtained from a finite graph G by taking the convex hull of the columns of the Laplacian matrix for G. The Laplacian simplex is extended through the use of a parallel construction with a finite digraph D to obtain the Laplacian polytope, PD. Basic properties of both families of simplices, PG and PD, are established using techniques from Ehrha

APA, Harvard, Vancouver, ISO, and other styles

3

Grinshpun, Andrey Vadim. "Some problems in Graph Ramsey Theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97767.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 149-156).<br>A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs that are Ramsey minimal

APA, Harvard, Vancouver, ISO, and other styles

4

Garbe, Frederik. "Extremal graph theory via structural analysis." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8869/.

Full text

Abstract:

We discuss two extremal problems in extremal graph theory. First we establish a precise characterisation of 4-uniform hypergraphs with minimum codegree close to n/2 which contain a Hamilton 2-cycle. As a corollary we determine the exact Dirac threshold for Hamilton 2-cycles in 4-uniform hypergraphs, and we provide a polynomial-time algorithm which answers the corresponding decision problem for 4-graphs with minimum degree close to n/2. In contrast we also show that the corresponding decision problem for tight Hamilton cycles in dense k-graphs is NP-complete. Furthermore we study the following

APA, Harvard, Vancouver, ISO, and other styles

5

Fiala, Nick C. "Some topics in combinatorial design theory and algebraic graph theory /." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957198077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Edwards, C. S. "Some extremal problems in graph theory." Thesis, University of Reading, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Weaver, Robert Wooddell. "Some problems in structural graph theory /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487268021746449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hatt, Justin Dale. "Online assessment of graph theory." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/13389.

Full text

Abstract:

The objective of this thesis is to establish whether or not online, objective questions in elementary graph theory can be written in a way that exploits the medium of computer-aided assessment. This required the identification and resolution of question design and programming issues. The resulting questions were trialled to give an extensive set of answer files which were analysed to identify whether computer delivery affected the questions in any adverse ways and, if so, to identify practical ways round these issues. A library of questions spanning commonly-taught topics in elementary graph t

APA, Harvard, Vancouver, ISO, and other styles

9

Letzter, Shoham. "Extremal graph theory with emphasis on Ramsey theory." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Holloway, Nick. "Parallel algorithms in graph theory and algebra." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338724.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graph theory. Sequences (Mathematics)"

1

Gould, Ronald. Graph theory. Benjamin/Cummings Pub. Co., 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chemical graph theory. 2nd ed. CRC Press, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

M, Parmenter Michael, ed. Discrete mathematics with graph theory. 3rd ed. Pearson Prentice Hall, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

M, Parmenter Michael, ed. Discrete mathematics with graph theory. Prentice Hall, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

M, Parmenter Michael, ed. Discrete mathematics with graph theory. 2nd ed. Prentice Hall, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Erciyes, K. Discrete Mathematics and Graph Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61115-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Graph decompositions: A study in infinite graph theory. Clarendon Press, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

1957-, Zhang Ping, ed. Introduction to graph theory. McGraw-Hill Higher Education, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wilson, Robin J., and Lowell W. Beineke. Topics in structural graph theory. Cambridge University Press, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

dedicatee, Kakutani Shizuo 1911-2004, Hajian Arshag author, Itō Yūji 1935 author, and Prasad Vidhu author, eds. Weakly wandering sequences in ergodic theory. Springer, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph theory. Sequences (Mathematics)"

1

Everest, Graham, Alf van der Poorten, Igor Shparlinski, and Thomas Ward. "Sequences arising in graph theory and dynamics." In Mathematical Surveys and Monographs. American Mathematical Society, 2003. http://dx.doi.org/10.1090/surv/104/11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

O’Regan, Gerard. "Graph Theory." In Mathematics in Computing. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4534-9_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fortney, Jon Pierre. "Graph Theory." In Discrete Mathematics for Computer Science. Chapman and Hall/CRC, 2020. http://dx.doi.org/10.1201/9781003091479-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nievergelt, Yves. "Graph Theory." In Foundations of Logic and Mathematics. Birkhäuser Boston, 2002. http://dx.doi.org/10.1007/978-1-4612-0125-0_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wallis, W. D. "Graph Theory." In A Beginner's Guide to Finite Mathematics. Birkhäuser Boston, 2012. http://dx.doi.org/10.1007/978-0-8176-8319-1_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wallis, W. D. "Graph Theory." In A Beginner's Guide to Discrete Mathematics. Birkhäuser Boston, 2012. http://dx.doi.org/10.1007/978-0-8176-8286-6_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wallis, W. D. "Graph Theory." In A Beginner’s Guide to Finite Mathematics. Birkhäuser Boston, 2004. http://dx.doi.org/10.1007/978-1-4757-3814-8_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wallis, W. D. "Graph Theory." In A Beginner’s Guide to Discrete Mathematics. Birkhäuser Boston, 2003. http://dx.doi.org/10.1007/978-1-4757-3826-1_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mathew, Sunil, John N. Mordeson, and Davender S. Malik. "Sequences, Saturation, Intervals and Gates in Fuzzy Graphs." In Fuzzy Graph Theory. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71407-3_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bagdasar, Ovidiu. "Elements of Graph Theory." In Concise Computer Mathematics. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01751-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph theory. Sequences (Mathematics)"

1

Demkanin, Peter, Karolína Šromeková, and Adam Slovák. "Exponential Function in Physics Education from the view of Knowledge in Pieces Theory." In INNODOCT 2020. Editorial Universitat Politècnica de València, 2020. http://dx.doi.org/10.4995/inn2020.2020.11829.

Full text

Abstract:

Learning is deeply rooted in the social environment of pupils and can flourish in a well-designed optimal learning environment in schools. Participative teaching-learning requires activities set in many different contexts, developing the grain-size pieces of knowledge and chaining of the fragments by causal chaining, time sequences and mathematical similarities. Based on the Knowledge-in-Pieces theory by diSessa, we focus on the development of the ability to think in terms of the exponential function, in Physics education from the age of 12. Main ideas are supported by experience with one acti

APA, Harvard, Vancouver, ISO, and other styles

2

Abdullah, Rosni, Nur' Aini Abdul Rashid, Fazilah Othman, Kamel Ariffin Mohd Atan, and Isthrinayagy S. Krishnarajah. "Graph Theory In Protein Sequence Clustering And Tertiary Structural Matching." In INTERNATIONAL CONFERENCE ON MATHEMATICAL BIOLOGY 2007: ICMB07. AIP, 2008. http://dx.doi.org/10.1063/1.2883845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

THOMASSEN, CARSTEN. "CHROMATIC GRAPH THEORY." In Proceedings of the International Conference on Fundamental Sciences: Mathematics and Theoretical Physics. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812811264_0008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kusmayadi, Tri Atmojo, and Nugroho Arif Sudibyo. "The eccentric digraph of caterpillar graph and generalized Jahangir graph." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0040222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pratama, Javas Alfreda Belva Yoga, and Tri Atmojo Kusmayadi. "On the local metric dimension of dipyramidal graph and king graph." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0039319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Setiawan, Ekky Kurnia, and I. Ketut Budayasa. "Application of graph theory concept for traffic light control at crossroad." In INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: Empowering Engineering using Mathematics. Author(s), 2017. http://dx.doi.org/10.1063/1.4994457.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Khasanah, Himawanti Rizqi, Putranto Hadi Utomo, and Bowo Winarno. "Schemes of network coding on fan graph F2,4 and closed helm graph CH4." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0039774.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"BELIEF PROPAGATION IN SPATIOTEMPORAL GRAPH TOPOLOGIES FOR THE ANALYSIS OF IMAGE SEQUENCES." In International Conference on Computer Vision Theory and Applications. SciTePress - Science and and Technology Publications, 2010. http://dx.doi.org/10.5220/0002818501170124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rahmawati, Ami, Vika Yugi Kurniawan та Supriyadi Wibowo. "The diameter of annihilator ideal graph of ℤn". У THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0039847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Akerina, A., and K. A. Sugeng. "Graceful labeling on a multiple-fan graph with pendants." In THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0039411.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph theory. Sequences (Mathematics)"

1

Robertson, Neil, and Paul Seymour. Graph Structure Theory: Proceedings of a Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, at the University of Washington, Seattle. Contemporary Mathematics 147. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada266435.

Full text

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!