Results 21 to 30 of about 3,337,855 (342)
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
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
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another G p , i.e. , whether G
Fan, Wenfei+4 more
core +1 more source
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
Line graph characterization of power graphs of finite nilpotent groups [PDF]
This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all finite nilpotent groups (except non-abelian $2$-groups) whose proper power graphs are line graphs.
arxiv +1 more source
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
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
THE k-INDEPENDENT GRAPH OF A GRAPH [PDF]
Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent sets of $G$ that have cardinality at most $k$.
Abdul Jalil M. Khalaf+2 more
openaire +3 more sources
Smith forms for adjacency matrices of circulant graphs [PDF]
We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andrásfai graph, Doob ...
Williams, Gerald
core +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source