Results 51 to 60 of about 8,500 (116)
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
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
MLRQ: an efficient labeling scheme for reachability queries on reduced DAGs
Journal of King Saud University: Computer and Information SciencesAnswering reachability queries is a fundamental operation in graph theory. Existing methods either build an index for partial reachability, which may lead to costly graph traversal during query processing, or construct an index for complete reachability,
Haiyan Zhang +2 more
doaj +1 more source
Zeta functions of quaternion weighted graphs (Research on algebraic combinatorics and representation theory of finite groups and vertex operator algebras)グラフのゼータ関数は, 伊原[6]により定義された伊原ゼータ関数が起源である. 伊原ゼータ関数は, PGL(2, mathbb{Q}_{p})の捻れのない余コンパクトな離散部分群rから定まるセルバーグゼータ関数の類似であり, 母関数型表示と行列式表示を持つことが[6]において示された. その後, Serre[15]により, 伊原ゼータ関数は, SL(2, mathbb{Q}_{p})に付随したBruhat-Tits tree(無限正則木)のrによる商グラフ(有限正則グラフ)のゼータ関数であることが示唆され, 砂田[17, 18]によってグラフのゼータ関数が確立された. その後多くの研究者の貢献により, グラフのゼータ関数は大きく発展した.
openaire
Image contraction through fuzzy soft outerplanar graph structures. [PDF]
Sci RepJaisankar D, Ramalingam S, Zegeye GB.
europepmc +1 more source
Note on extremal problems about connected subgraph sums. [PDF]
Graphs CombCambie S, Groenland C.
europepmc +1 more source