Results 31 to 40 of about 199,356 (251)
Search for the end of a path in the d-dimensional grid and in other graphs [PDF]
We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \in V(G)$.
Gerbner, Dániel+4 more
core +2 more sources
Spin Foams Without Spins [PDF]
We formulate the spin foam representation of discrete SU(2) gauge theory as a product of vertex amplitudes each of which is the spin network generating function of the boundary graph dual to the vertex.
Hnybida, Jeff
core +2 more sources
Finding minimal vertex extensions of a colored undirected graph
Background. The research considers the results of the finding minimal vertex extensions of the colored undirected graphs. This topic relates to the modelling of the completely fault tolerant technical systems with the different typed objects in the ...
M.B. Abrosimov, P.V. Razumovsky
doaj +1 more source
Unfolding of Finite Concurrent Automata [PDF]
We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
Graph coloring game is one of application in graph theory. The goal in this article is determine game chromatic number of tadpole graph, broom graph, and tribune graph.
Fransiskus Fran, M Luthfi Abdurahman
doaj +1 more source
Computing Eccentricity Based Topological Indices of Octagonal Grid O n m
Graph theory is successfully applied in developing a relationship between chemical structure and biological activity. The relationship of two graph invariants, the eccentric connectivity index and the eccentric Zagreb index are investigated with regard ...
Xiujun Zhang+3 more
doaj +1 more source
A central local metric dimension on acyclic and grid graph
The local metric dimension is one of many topics in graph theory with several applications. One of its applications is a new model for assigning codes to customers in delivery services. Let $ G $ be a connected graph and $ V(G) $ be a vertex set of $ G $.
Yuni Listiana+3 more
doaj +1 more source
Hamilton cycles in dense vertex-transitive graphs [PDF]
A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large.
Alon+28 more
core +2 more sources
Further Results on Resistance Distance and Kirchhoff Index in Electric Networks
In electric circuit theory, it is of great interest to compute the effective resistance between any pairs of vertices of a network, as well as the Kirchhoff index.
Qun Liu, Jia-Bao Liu, Jinde Cao
doaj +1 more source
The adjacency matrix of one type of graph and the Fibonacci numbers [PDF]
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence.
Bozkurt, Durmuş+2 more
core