Results 21 to 30 of about 795,931 (124)
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
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
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs [PDF]
arXiv, 2023 Given an undirected graph $G$ and a multiset of $k$ terminal pairs $\mathcal{X}$, the Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether $G$ has $k$ pairwise internally vertex-disjoint paths and $k$ pairwise edge-disjoint paths, respectively, connecting every terminal pair in~$\mathcal{X}$.
arxiv
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
A central local metric dimension on acyclic and grid graph
AIMS Mathematics, 2023 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
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
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
Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph [PDF]
arXiv, 2023 The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander codes are Error Correcting codes made up of bipartite expander graphs. In this paper, first we prove the interlacing
arxiv
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees [PDF]
Discrete Applied Mathematics, 159(8):872-875, 2011, 2011 The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a more refined bound in terms of the vertex degree sequence of a graph, might be regarded today as a classical result. We show how these statements can be generalized to directed
arxiv +1 more source
A SURVEY M-POLAR FUZZY GRAPHS [PDF]
Fiabilitate şi Durabilitate, 2019 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj