Log in

Relevant bibliographies by topics / Pancyclic

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Pancyclic'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 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 'Pancyclic.'

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 "Pancyclic"

1

McKee, Terry A. "Strongly pancyclic and dual-pancyclic graphs." Discussiones Mathematicae Graph Theory 29, no. 1 (2009): 5. http://dx.doi.org/10.7151/dmgt.1429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Randerath, Bert, Ingo Schiermeyer, Meike Tewes, and Lutz Volkmann. "Vertex pancyclic graphs." Discrete Applied Mathematics 120, no. 1-3 (2002): 219–37. http://dx.doi.org/10.1016/s0166-218x(01)00292-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

RANDERATH, B., L. VOLKMANN, I. SCHIERMEYER, and M. TEWES. "Vertex Pancyclic Graphs." Electronic Notes in Discrete Mathematics 3 (April 2000): 1–5. http://dx.doi.org/10.1016/s1571-0653(05)00760-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Randerath, Bert, Lutz Volkmann, Ingo Schiermeyer, and Meike Tewes. "Vertex Pancyclic Graphs." Electronic Notes in Discrete Mathematics 3 (May 1999): 166–70. http://dx.doi.org/10.1016/s1571-0653(05)80048-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tewes, Meike. "Pancyclic in-tournaments." Discrete Mathematics 233, no. 1-3 (2001): 193–204. http://dx.doi.org/10.1016/s0012-365x(00)00238-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Brandt, Stephan, Ralph Faudree, and Wayne Goddard. "Weakly pancyclic graphs." Journal of Graph Theory 27, no. 3 (1998): 141–76. http://dx.doi.org/10.1002/(sici)1097-0118(199803)27:3<141::aid-jgt3>3.0.co;2-o.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Stacho, Ladislav. "Locally Pancyclic Graphs." Journal of Combinatorial Theory, Series B 76, no. 1 (1999): 22–40. http://dx.doi.org/10.1006/jctb.1998.1885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bollobás, Béla, and Andrew Thomason. "Weakly Pancyclic Graphs." Journal of Combinatorial Theory, Series B 77, no. 1 (1999): 121–37. http://dx.doi.org/10.1006/jctb.1999.1916.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Song, Zeng Min. "Pancyclic oriented graphs." Journal of Graph Theory 18, no. 5 (1994): 461–68. http://dx.doi.org/10.1002/jgt.3190180504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zamfirescu, Carol T. "(2)-pancyclic graphs." Discrete Applied Mathematics 161, no. 7-8 (2013): 1128–36. http://dx.doi.org/10.1016/j.dam.2012.11.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Pancyclic"

1

Granholm, Jonas. "Some cyclic properties of graphs with local Ore-type conditions." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129213.

Full text

Abstract:

A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. In this thesis we investigate two classes of graphs, defined by local criteria. Graphs in these classes, with a simple set of exceptions K, were proven to be Hamiltonian by Asratian, Broersma, van den Heuvel, and Veldman in 1996 and by Asratian in 2006, respectively. We prove here that in addition to being Hamiltonian, graphs in these classes have stronger cyclic properties. In particular, we prove that if a graph G belongs to one of these classes, th

APA, Harvard, Vancouver, ISO, and other styles

2

Chan, Chang-Hung, and 詹宏章. "Geodesic-pancyclic graphs." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/88ksmt.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>資訊工程系<br>95<br>A graph G is a finite nonempty vertex set V(G), together with an (possible empty) edge set E(G) of 2-element subset of V (G). A shortest path connecting two vertices u and v is called a u-v geodesic. The distance between u and v in a graph G, denoted by dG(u,v), is the number of edges in a u-v geodesic. A graph G with n vertices is edge-pancyclic if every edge of G belongs to an l-cycle for every 3<=l<=n. G is called panconnected if, for each pair of vertices u,v in V(G) and for each integer l with dG(u,v)<=l<=n−1, there is a path of length l in G that connects

APA, Harvard, Vancouver, ISO, and other styles

3

Chia-WenCheng and 鄭嘉文. "A Study of Pancyclic Properties of Cartesian Product Graphs with Faulty Edges." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/21935927199530174212.

Full text

Abstract:

博士<br>國立成功大學<br>資訊工程學系<br>103<br>For interconnection network, the existence of the cycle has many discussions and applications. The pancyclic problem involves testing whether or not a graph contains cycles of all possible lengths. Sometimes, the length of the desired cycle satisfies some conditions. For example, the bipancyclic problem involves testing whether or not a graph contains cycles of all possible even lengths. Edge-pancyclic property and edge-bipancyclic property are the extension of the above two properties. A graph is edgepancyclic if each edge of graph lies on a cycle of every pos

APA, Harvard, Vancouver, ISO, and other styles

4

Feng, Jinfeng [Verfasser]. "Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments / vorgelegt von Jinfeng Feng." 2008. http://d-nb.info/988129760/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wu, Ruei-Yu, and 吳瑞瑜. "Node-Disjoint Paths and Pancycles in Hierarchical Hypercube Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/62817421450089399705.

Full text

Abstract:

博士<br>國立臺灣大學<br>資訊工程學研究所<br>100<br>Advances in technology, especially the VLSI circuit technology, have made it possible to build a large-scale parallel and distributed system involving thousands or even tens of thousands of processors. One crucial step on designing such a system is to determine the topology of the interconnection network. The network topology affects not only the hardware architecture but also the nature of the system software that can be used in a parallel and distributed system. Since the number of links per node is physically restricted due to hardware limitations, the to

APA, Harvard, Vancouver, ISO, and other styles

6

Chen, Edward Yi-Ching, and 陳乙菁. "Pancycles and Hamiltonian Connectedness of the Pyramid Network with One Node or One Edge Fault." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/26040632685893472583.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>91<br>Abstract Since the pyramid network holds the properties of meshes and tree structures, it becomes one of the important architectures in parallel computing, network computing, computer vision, and image processing. Up to now, there are topological properties of pyramid networks have been investigated in literatures. With those literatures, we know that pyramid networks not only have very good fault tolerance properties but also have pancyclic and Hamiltonian-connected properties. In this thesis, we derive a pair of algorithms to improve th

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Pancyclic"

1

George, John C., Abdollah Khodkar, and W. D. Wallis. Pancyclic and Bipancyclic Graphs. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31951-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wallis, W. D., John C. George, and Abdollah Khodkar. Pancyclic and Bipancyclic Graphs. Springer, 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Pancyclic"

1

George, John C., Abdollah Khodkar, and W. D. Wallis. "Uniquely Pancyclic Graphs." In SpringerBriefs in Mathematics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31951-3_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stevens, Brett. "The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10719839_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

"Pancyclic and Panconnected Property." In Graph Theory and Interconnection Networks. CRC Press, 2008. http://dx.doi.org/10.1201/9781420044829.ch17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Pancyclic"

1

Hung, Chun-Nan, Tzu-Liang Kung, Lih-Hsing Hsu, Kevin Chen, and Shi Zhe Lai. "The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes." In 2017 5th Intl Conf on Applied Computing and Information Technology/4th Intl Conf on Computational Science/Intelligence and Applied Informatics/2nd Intl Conf on Big Data, Cloud Computing, Data Science (ACIT-CSII-BCD). IEEE, 2017. http://dx.doi.org/10.1109/acit-csii-bcd.2017.65.

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!