Results 71 to 80 of about 206,170 (167)
Locally $s$-distance transitive graphs [PDF]
, 2010 We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph is in the class
Alice Devillers +4 more
core +1 more source
Scattering theory and discrete-time quantum walks
, 2004 We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each.
Ambainis +21 more
core +1 more source
Sum-edge characteristic polynomials of graphs
Journal of Taibah University for Science, 2019 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
Generalized Zagreb index of some dendrimer structures
Universal Journal of Mathematics and Applications, 2018 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
Journal of Applied Mathematics, 2012 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
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015 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
, 2018 Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their ...
Boomari, Hossein +2 more
core
The $z$-matching problem on bipartite graphs
, 2018 The $z$-matching problem on bipartite graphs is studied with a local algorithm. A $z$-matching ($z \ge 1$) on a bipartite graph is a set of matched edges, in which each vertex of one type is adjacent to at most $1$ matched edge and each vertex of the ...
Zhao, Jin-Hua
core
Fault-Tolerant Metric Dimension in Carbon Networks
FoundationsIn this paper, we study the fault-tolerant metric dimension in graph theory, an important measure against failures in unique vertex identification. The metric dimension of a graph is the smallest number of vertices required to uniquely identify every ...
Kamran Azhar, Asim Nadeem, Yilun Shang
doaj +1 more source
Maximal Unicyclic Graphs With Respect to New Atom-bond Connectivity Index
Acta Chimica Slovenica, 2013 The concept of atom-bond connectivity (ABC) index was introduced in the chemical graph theory in 1998. The atom-bond connectivity (ABC) index of a graph G defined as (see formula in text) where E(G) is the edge set and di is the degree of vertex v(i) of
Kinkar Ch. Das, Kexiang Xu, Ante Graovac
doaj