Results 51 to 60 of about 280 (99)
Enumeration of Triangles in a Divisor Cayley Graph [PDF]
, 2013 In this paper a new class of arithmetic Cayley graphs, namely, divisor Cayley graphs associated with the divisor function d ƒvnƒw , n „d1,an integer is introduced. It is shown that this graph is regular, hamiltonian, connected and not bipartite, and when
Madhavi, L +2 more
core +1 more source
Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs
, 2016 A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is Hamiltonian. A graph is supereulerian if it has a spanning Eulerian subgraph.
Chen, Zhi-Hong
core +1 more source
EULERIAN SUBGRAPHS in 3-Edge-Connected Graps AND HAMILTONIAN LINE GRAPHS
, 2003 In this paper, we show that if G is a 3-edge-connected graph with S V ðGÞ and jSj 12, then either G has an Eulerian subgraph H such that S V ðHÞ,orG can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen ...
Deying Li +4 more
core
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs
, 1995 . In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube and polymino. A Spanning closed trail is an eulerian subgraph containing all vertices of a given graph. For general grid graphs we prove that the problem
Alexander Zelikovsky, Hwan-gue Cho
core
The flower conjecture in special classes of graphs [PDF]
, 1995 We say that a spanning eulerian subgraph F ⊂ G is a flower in a graph G if there is a vertex u ∈ V(G) (called the center of F) such that all vertices of G except u are of the degree exactly 2 in F.
Ryjáček, Zdeněk, Schiermeyer, Ingo
core
ทฤษฎีกราฟเบื้องต้นและการประยุกต์ [PDF]
, 2015 บทคัดย่อในบทความวิชาการฉบับนี้ได้อภิปรายถึงปัญหาคลาสสิกที่น่าสนใจ 3 ปัญหาในทฤษฎีกราฟได้แก่ปัญหาการจับมือทักทายในงานเลี้ยงปัญหาการเดินข้ามสะพานทั้งเจ็ดแห่งเมืองเคอนิกส์แบร์ก และปัญหาการหาวงแฮมิลตันและรอยเดินออยเลอร์ในกราฟ การหาคำตอบของทั้งสามปัญหาอาศ ...
มะกาเจ, นิฟาตมะห์; ภาควิชาคณิตศาสตร์และวิทยาการคอมพิวเตอร์ คณะวิทยาศาสตร์และเทคโนโลยี มหาวิทยาลัยสงขลานครินทร์ วิทยาเขตปัตตานี และนักวิจัย กองทุนวิจัยวิทยาเขตปัตตานี มหาวิทยาลัยสงขลานครินทร์ วิทยาเขตปัตตานี +1 more
core +2 more sources
Alguns tipos de grafos e aplicações [PDF]
, 2022 Orientador: Prof. Dr. Marcos André VerdiDissertação (mestrado em Matemática)--Universidade Estadual de Maringá, Dep. de Matemática, Programa de Mestrado Profissional em Matemática em Rede Nacional, 2022Neste trabalho apresentamos a parte introdutória da ...
Burguetti, Renata
core
The power of programmed grammars with graphs from various classes
, 2006 Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs.
Liu, Guangwu +8 more
core +1 more source
Depends TSP, gtools,graph,methods Suggests License GPL-2 Repository CRAN
, 2014 Description Eulerian tours and Hamiltonian decompositions of complete graphs are used to amelio-rate order effects in statistical ...
C. B. Hurley +3 more
core
Intersection graphs of ideals of rings
, 2009 In this paper, we consider the intersection graph G(R) of nontrivial left ideals of a ring R. We characterize the rings R for which the graph G(R) is connected and obtain several necessary and sufficient conditions on a ring R such that G(R) is complete.
Ghosh, Shamik +3 more
core +1 more source