Graph Hamiltonian properties are studied especially in connection with graph connectivity properties. A graph is called Hamiltonian if there is a path passing through all its vertices in that graph. In this work we are interested in sparse graph setting for which this question was already solved e.g. using the famous theorem of Courcelle [4]. It is possible to express the Hamiltonian property b...

We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixed-endpoint path cover of G with respect to T is a set of vertex-disjoint paths P that covers the vertices of G such that the k vertices of T are all endpoints of the paths in P. The kPC problem is to find a k-fixed-endpoi...

AbstructA new model for the bidirectional reflectance of a vegetation cover combines principles of geometric optics and radiative transfer. It relies on gap probabilities and path length distributions to model the penetration of irradiance from a parallel source and the single and multiple scattering of that irradiance in the direction of an observer. The model applies to vegetation covers of d...

For a connected graph G = (V (G), E(G)) and two disjoint subsets of V (G) A = {α1, . . . , αk} and B = {β1, . . . , βk}, a paired (many-to-many) k-disjoint path cover of G joining A and B is a vertex-disjoint path cover {P1, . . . , Pk} such that Pi is a path from αi to βi for 1 ≤ i ≤ k. In the recent paper [Disjoint Path Covers in Cubes of Connected Graphs, Discrete Mathematics 325 (2014) 65–7...

This paper introduces the problem of identifying vertices of a graph using paths. An identifying path cover of a graph G is a set P of paths such that each vertex belongs to a path of P, and for each pair u, v of vertices, there is a path of P which includes exactly one of u, v. This new notion is related to a large number of other identi cation problems in graphs and hypergraphs. We study the ...

in order to investigate genetic correlation and path analysis between grain yield and yield components, fifteen early maturing hybrids of grain corn (zea. mays) using a randomized complete block design with 4 replications were evaluated in khoramabad agricultural research center, iran. the data were collected and analyzed for ear emergence date, anthesis date, maturity date, plant height, ear h...

In a graph G, k disjoint paths joining a single source and k distinct sinks that cover all the vertices in the graph are called a one-tomany k-disjoint path cover of G. We consider a k-disjoint path cover in a graph with faulty vertices and/or edges obtained by merging two graphs H0 and H1, |V (H0)| = |V (H1)| = n, with n pairwise nonadjacent edges joining vertices in H0 and vertices in H1. We ...

In the present work, the chaotic motion control of a mobile robot is studied, in order to cover a terrain with unpredictable way. The proposed control strategy is based on a chaotic path planning generator. As a chaotic generator, we have used three different nonlinear dynamical systems, the Chua oscillator, the Lorenz system, and a nonlinear circuit with a nonlinear resistor having an i-v char...