Results 51 to 60 of about 795,931 (124)
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj +1 more source
Quasi-Regular Graphs Associated with Commutative Rings
One of the most important branches of mathematics is algebraic graph theory, which solves graph problems with algebraic methods. In graph theory, several algebraic properties of a ring can be represented.
Nasr Zeyada+2 more
doaj +1 more source
Information Recovery in Shuffled Graphs via Graph Matching [PDF]
While many multiple graph inference methodologies operate under the implicit assumption that an explicit vertex correspondence is known across the vertex sets of the graphs, in practice these correspondences may only be partially or errorfully known.
arxiv
Matching Correlated Inhomogeneous Random Graphs using the $k$-core Estimator [PDF]
We consider the task of estimating the latent vertex correspondence between two edge-correlated random graphs with generic, inhomogeneous structure. We study the so-called \emph{$k$-core estimator}, which outputs a vertex correspondence that induces a large, common subgraph of both graphs which has minimum degree at least $k$.
arxiv
Sum-edge characteristic polynomials of graphs
Modelling a chemical compound by a (molecular) graph helps us to obtain some required information about the chemical and physical properties of the corresponding molecular structure.
Mert Sinan Oz+2 more
doaj +1 more source
An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.
arxiv
Generalized Zagreb index of some dendrimer structures
Chemical graph theory, is a branch of mathematical chemistry which deals with the nontrivial applications of graph theory to solve molecular problem. A chemical graph is represent a molecule by considering the atoms as the vertices and bonds between them
Anita Pal+3 more
doaj +1 more source
Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order $6p$ [PDF]
It is shown that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order $6p$ which is not genuinely imprimitive contains a Hamilton cycle.
arxiv
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph.
Fatih Yılmaz, Durmuş Bozkurt
doaj +1 more source
AN EQUILIBRIUM SITUATION IN A PATROLLING GAME WITH A TRACKING CAMERA
Equilibrium situations in a problem of patrolling on a graph were obtained using game theory methods. The solution of the game was found for a graph modeling the flux of information from data source to sink.
Vasily Gusev
doaj +1 more source