Results 61 to 70 of about 280 (99)
Unit Regular Graphs over Finite Rings [PDF]
This paper introduces the concept of a unit regular graph over any given ring. The unit regular graph is a simple undirected graph, where its vertices correspond to elements of the ring.
Isnaini, Uha +4 more
core +1 more source
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters
, 2004 It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebraic (relating the products of eigenvalues of the graphs' adjacency matrices ...
Golin, Mordecai J., Leung, Yiu Cho
core
Eulerian-Hamiltonian Duality: A Structural Unification of Graph Traversals
This paper introduces a theoretical framework for a structural duality between Eulerian and Hamiltonian cycles in graph theory. Historically treated as distinct problems with disparate computational complexities, we propose a novel graph transformation, the Vertex-Edge Incidence Graph (VEIG), that maps the edge-centric properties of Eulerian circuits ...
openaire +2 more sources
, 2015 Vn-Arithmetic graph has been introduced by Vasumathi and Vangipuram [9]. In this paper some properties of Vn-Arithmetic graph, maximum degree, minimum degree, number of edges, di-ameter, radius, Hamiltonian and Eulerian are studied.
R. Ranjarajan +2 more
core
, 2007 An embedding of a graph in a surface gives rise to a combinatorial design whose blocks correspond to the faces of the embedding. Particularly interesting graphs include complete and complete multipartite graphs. Embeddings of these in which the faces are
Grannell, Mike, Griggs, Terry
core +2 more sources
Modal Logics for Finite Graphs
, 2007 In this work, we present modal logics for four classes of finite graphs: finite direct graphs, finite acyclic direct graphs, finite undirect graphs, finite irreflexive undirect graphs.
Mario Benevides, Depart Ciencia
core
On the non-commuting graph associated to a finite-dimensional Lie algebra [PDF]
In this paper, we define the non-commuting graph associated to a Lie algebra L and obtain some basic graph properties such as connectivity, diameter, girth, Hamiltonian and Eulerian.
Erfanian, Ahmad +2 more
core +1 more source
Vertex coloring, eulerian and hamiltonian paths of delaunay graphs associated to sensor networks
In this paper we study a link between sensor networks and Graph Theory. The former offers a distributed system of interconnected devices that transmit and collect data, while the latter provides a powerful framework for analyzing and modeling complex networks. More concretely, we deal with vertex coloring, eulerian and hamiltonian paths of the Delaunay
Ceballos, M, Millán, M
openaire +1 more source
A computer based approach in determining the Hamiltonian cycle of a graph
, 1993 This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian cycles did not enjoy the same success as that of other graphs, such as Eulerian cycles, since mathematicians have not yet found a general criterion that ...
Dy, Caroline K. +1 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Usage of Eulerian and Hamiltonian Graph in Pandemic Situation
Journal of Applied Science and Education (JASE) , 2021The existence of Euler and Hamiltonian graph make it easier to solve a real-life problem. During the time of pandemic “Covid-19”, it is very essential for each one of us to be vaccinated. Vaccination is done in the hospitals by using Eulerian and Hamiltonian graphs not only to prevent people from infecting but also to increase the speed of vaccination.
Ambrish Kumar Pandey
exaly +2 more sources