Log in

Relevant bibliographies by topics / Trivalent Graphs

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Trivalent Graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 September 2023

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 'Trivalent 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 "Trivalent Graphs"

1

Ma, Xuesong, and Ruji Wang. "Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150." Algebra Colloquium 15, no. 03 (2008): 379–90. http://dx.doi.org/10.1142/s1005386708000370.

Full text

Abstract:

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

2

Ishii, Atsushi. "The Markov theorems for spatial graphs and handlebody-knots with Y-orientations." International Journal of Mathematics 26, no. 14 (2015): 1550116. http://dx.doi.org/10.1142/s0129167x15501165.

Full text

Abstract:

We establish the Markov theorems for spatial graphs and handlebody-knots. We introduce an IH-labeled spatial trivalent graph and develop a theory on it, since both a spatial graph and a handlebody-knot can be realized as the IH-equivalence classes of IH-labeled spatial trivalent graphs. We show that any two orientations of a graph without sources and sinks are related by finite sequence of local orientation changes preserving the condition that the graph has no sources and no sinks. This leads us to define two kinds of orientations for IH-labeled spatial trivalent graphs, which fit a closed br

APA, Harvard, Vancouver, ISO, and other styles

3

SPENCER-BROWN, GEORGE. "UNCOLORABLE TRIVALENT GRAPHS." Cybernetics and Systems 29, no. 4 (1998): 319–44. http://dx.doi.org/10.1080/019697298125623.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

O'Keeffe, Michael, and Michael M. J. Treacy. "Tangled piecewise-linear embeddings of trivalent graphs." Acta Crystallographica Section A Foundations and Advances 78, no. 2 (2022): 128–38. http://dx.doi.org/10.1107/s2053273322000560.

Full text

Abstract:

A method is described for generating and exploring tangled piecewise-linear embeddings of trivalent graphs under the constraints of point-group symmetry. It is shown that the possible vertex-transitive tangles are either graphs of vertex-transitive polyhedra or bipartite vertex-transitive nonplanar graphs. One tangle is found for 6 vertices, three for 8 vertices (tangled cubes), seven for 10 vertices, and 21 for 12 vertices. Also described are four isogonal embeddings of pairs of cubes and 12 triplets of tangled cubes (16 and 24 vertices, respectively). Vertex 2-transitive embeddings are obtai

APA, Harvard, Vancouver, ISO, and other styles

5

Beezer, Robert A. "Trivalent orbit polynomial graphs." Linear Algebra and its Applications 73 (January 1986): 133–46. http://dx.doi.org/10.1016/0024-3795(86)90235-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Krichever, I. M., and S. P. Novikov. "Trivalent graphs and solitons." Russian Mathematical Surveys 54, no. 6 (1999): 1248–49. http://dx.doi.org/10.1070/rm1999v054n06abeh000239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Benvenuti, Silvia, and Riccardo Piergallini. "Automorphisms of trivalent graphs." European Journal of Combinatorics 34, no. 6 (2013): 987–1009. http://dx.doi.org/10.1016/j.ejc.2013.01.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Carter, J. Scott, and Seung Yeop Yang. "Twist spinning knotted trivalent graphs." Proceedings of the American Mathematical Society 144, no. 3 (2015): 1371–82. http://dx.doi.org/10.1090/proc/12801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kobayashi, Kazushiro. "Curvature dimension of trivalent graphs." Differential Geometry and its Applications 8, no. 2 (1998): 157–62. http://dx.doi.org/10.1016/s0926-2245(98)00003-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Scharlemann, Martin, and Abigail Thompson. "Thinning Genus Two Heegaard Spines in S3." Journal of Knot Theory and Its Ramifications 12, no. 05 (2003): 683–708. http://dx.doi.org/10.1142/s0218216503002706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Trivalent Graphs"

1

Gans, Marijke van. "Topics in trivalent graphs." Thesis, University of Birmingham, 2007. http://etheses.bham.ac.uk//id/eprint/103/.

Full text

Abstract:

Chapter 0 details the notation and terminology used. Chapter 1 introduces the usual linear algebra over GF2 of edge space E and its orthogonal subspaces Z (cycle space) and Z* (cut space). "Reduced vectors" are defined as elements of the quotient space E/Z*. Reduced vectors of edges give a simple way of characterising edges that are bridges (their reduced vector is null) or 2-edge cuts (their vectors are equal), and also of spanning trees (the edges outside the tree are a basis) and form to the best of my knowledge a new approach. They are also useful in later chapters to describe Tait colorin

APA, Harvard, Vancouver, ISO, and other styles

2

Comstock, Jana. "A finite presentation of knotted trivalent graphs." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3320703.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2008.<br>Title from first page of PDF file (viewed Sept. 24, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 46).

APA, Harvard, Vancouver, ISO, and other styles

3

Wu, Chung-Yen, and 吳忠諺. "A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/29268420642815361824.

Full text

Abstract:

碩士<br>大同大學<br>資訊工程學系(所)<br>104<br>Let G be a graph. A subset F⊂V(G) is called an R^k-vertex-cut of G if G-F is disconnected and each vertex u∈V(G)-F has at least k good neighbors in G-F. The size of a minimum R^k-vertex-cut of G, denoted by κ^k (G), is the R^k-vertex-connectivity of G. In this thesis, we prove that κ^1 (G_n) is equal to 4 for n≥3, κ^2 (G_n) is equal to 8 for n≥4, where G_n is the trivalent Cayley graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

Dancso, Zsuzsanna. "On a Universal Finite Type Invariant of Knotted Trivalent Graphs." Thesis, 2011. http://hdl.handle.net/1807/31731.

Full text

Abstract:

Knot theory is not generally considered an algebraic subject, due to the fact that knots don’t have much algebraic structure: there are a few operations defined on them (such as connected sum and cabling), but these don’t nearly make the space of knots finitely generated. In this thesis, following an idea of Dror Bar-Natan’s, we develop an algebraic setting for knot theory by considering the larger, richer space of knotted trivalent graphs (KTGs), which includes knots and links. KTGs along with standard operations defined on them form a finitely generated algebraic structure, in which many top

APA, Harvard, Vancouver, ISO, and other styles

5

Sanki, Bidyut. "Shortest Length Geodesics on Closed Hyperbolic Surfaces." Thesis, 2014. http://hdl.handle.net/2005/3049.

Full text

Abstract:

Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so called fat graph, which we call the systolic graph. The central question that we study in this thesis is: which fat graphs are systolic graphs for some surface -we call such graphs admissible. This is motivated in part by the observation that we can naturally decompose the moduli space of hyperbolic surfaces based on the associated systolic graphs. A systolic graph has a metric on it, so that all cycles on the graph that correspond to geodesics are of the same length a

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Trivalent Graphs"

1

Foster, Ronald M. The Foster census: R.M. Foster's census of connected symmetric trivalent graphs. Edited by Bouwer I. Z. Charles Babbage Research Centre, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zero-Symmetric Graphs: Trivalent Graphical Regular Representations of Groups. Elsevier Science & Technology Books, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Trivalent Graphs"

1

Gardner, Martin. "Trivalent Graphs, Snarks, and Boojums." In The Last Recreations. Springer New York, 1997. http://dx.doi.org/10.1007/978-0-387-30389-5_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

"Binary Trees, Trivalent Trees, Cubic Graphs, and Adjacency Diagrams." In Unitary Symmetry and Combinatorics. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812814739_0003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Trivalent Graphs"

1

Srimani, P. K., B. P. Sinha, B. B. Bhattacharya, and S. Ghosh. "On some properties of trivalent network graphs." In Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989. IEEE, 1989. http://dx.doi.org/10.1109/acssc.1989.1201046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Thurston, Dylan P. "The algebra of knotted trivalent graphs and Turaev's shadow world." In Invariants of Knots and 3--manifolds. Mathematical Sciences Publishers, 2004. http://dx.doi.org/10.2140/gtm.2002.4.337.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chi-Hsiang Yeh and E. A. Varvarigos. "Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph." In Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation. IEEE, 1999. http://dx.doi.org/10.1109/fmpc.1999.750613.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Onunka, Chiemela, Glen Bright, and Riaan Stopforth. "Complex augmentation in autonomie EEG-Cayley neural network: Integrating bipartite-trivalent graph with Erdos-Renyi in EEG network modelling." In 2014 13th International Conference on Control Automation Robotics & Vision (ICARCV). IEEE, 2014. http://dx.doi.org/10.1109/icarcv.2014.7064317.

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!