Results 21 to 30 of about 3,583,809 (318)
Packing Smaller Graphs into a Graph
Let G be a connected graph and \(\alpha_ m(G)\) denote the largest number of vertex-disjoint connected subgraphs \(H_ 1,H_ 2,...,H_ k\) of G each having m vertices. The authors obtain the following bounds for the m-packing number \(\alpha_ m(G)\) for a connected graph G of order n and maximum degree \(\Delta\). \[ \lceil \frac{n-m+1}{(m-1)(\Delta -1)+1}
Shin-ichi Tokunaga+2 more
openaire +3 more sources
How does road marking in horizontal curves influence driving behaviour?
Purpose Given the inconsistent application of various road markings on Czech rural roads, there is a question “How does road marking in horizontal curves influence driving behaviour?” The study objective was to assess how centreline and edgelines ...
Pavel Havránek+5 more
doaj +1 more source
Planar Graphs as VPG-Graphs [PDF]
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG.
Steven Chaplick, Torsten Ueckerdt
openaire +4 more sources
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about
openaire +6 more sources
Visual Analysis of Vehicle Trajectories for Determining Cross-Sectional Load Density
The goal of this work was to analyze the behavior of drivers on third class roads with and without horizontal lane marking. The roads have low traffic volume, and therefore a conventional short-term study would not be able to provide enough data. We used
Roman Juránek+4 more
doaj +1 more source
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
D. V. S Sastry, B.Syam Prasad Raju
openaire +3 more sources
Equitable Graph of a Graph [PDF]
A subset D of V is called an equitable dominating set if for every v ∈ V − D there exists a vertex u ∈ D such that uv ∈ E(G) and |d(u) − d(v)| ≤ 1 ,w hered(u) denotes the degree of vertex u and d(v) denotes the degree of vertex v. The minimum cardinality of such a dominating set is denoted by γ e and is called the equitable domination number of G ...
openaire +3 more sources
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are sets of graphs that are defined by forbidding finitely many local patterns. In this paper, we focus on the question
Arrighi, Pablo+2 more
openaire +3 more sources
Background To explore the long-term trajectories considering pneumonia volumes and lymphocyte counts with individual data in COVID-19. Methods A cohort of 257 convalescent COVID-19 patients (131 male and 126 females) were included.
Nannan Shi+13 more
doaj +1 more source
The tessellation problem is interesting to study, especially when it is associated with mathematical concepts. In this study, a graph coloring technique will be applied to solve the problem of wallpaper tessellation decoration. The main objective of this
Dafik+4 more
doaj +1 more source