Results 51 to 60 of about 357,448 (292)
On the structure of random graphs with constant $r$-balls [PDF]
, 2019 We continue the study of the properties of graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to the ball of radius $r$ in some fixed vertex-transitive graph $F$, for various choices of $F$ and $r$.
Benjamini, Itai, Ellis, David
core +2 more sources
The crossing numbers of products of a 5-vertex graph with paths and cycles
Discussiones Mathematicae Graph Theory, 1999 There are several known exact results on the crossing numbers of Cartesian products of paths, cycles or stars with “small” graphs. Let H be the 5-vertex graph defined from K5 by removing three edges incident with a common vertex. In this paper, we extend
Marián Klesc
semanticscholar +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
Distance Preserving Graph Simplification
, 2011 Large graphs are difficult to represent, visualize, and understand. In this paper, we introduce "gate graph" - a new approach to perform graph simplification. A gate graph provides a simplified topological view of the original graph.
Huang, Yan, Jin, Ruoming, Ruan, Ning
core +1 more source
Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]
, 2012 Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k.
B. Monien +14 more
core +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
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
An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion [PDF]
, 2015 Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 96(4):514--528, 2006]. Motivated from recent development on graph modification problems regarding
Kanté, Mamadou Moustapha +3 more
core +5 more sources
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
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