Results 31 to 40 of about 8,500 (116)
On the Vertex-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj +1 more source
Scientific Annals of Computer ScienceThe energy of a vertex in a graph plays a very important role in terms of its contribution to the total energy of a graph, a significant graph invariant in the field of chemical graph theory.
P. N. Simha +4 more
doaj +1 more source
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
, 2018 The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications.
Zhang, Yongfei +5 more
openaire +2 more sources
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)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
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 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
Finding minimal vertex extensions of a colored undirected graph
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 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
Further Results on Resistance Distance and Kirchhoff Index in Electric Networks
Discrete Dynamics in Nature and Society, 2016 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
Computing Eccentricity Based Topological Indices of Octagonal Grid O n m
Mathematics, 2018 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
Study of eccentricity based topological indices for benzenoid structure
South African Journal of Chemical Engineering, 2023 Topological indices play paramount role in defining chemical and structural properties of different compounds. Chemical graph theory is useful for predicting the bioactivity and physicochemical properties through numerical invariants.
Kamel Jebreen +5 more
doaj +1 more source