Spanning k-ended trees of 3-regular connected graphs
A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we obtain sufficient conditions for spanning k-trees of 3-
Hamed Ghasemian Zoeram, Daniel Yaqubi
doaj +2 more sources
Gale diagrams of convex polytopes and positive spanning sets of vectors
A positive k-spanning set (PkSS) in Euclidean m-space \({\mathbb{R}}^ m\) is a set of points such that each open half-space of \({\mathbb{R}}^ m\) bounded by a hyperplane through the origin contains at least k points of the set. In this paper, the author investigates the maximal cardinality of a minimal (with respect to inclusion) PkSS of \({\mathbb{R}}
Marcus, Daniel A.
openaire +2 more sources
Budgeting approaches and employee motivation in the hospitality industry [PDF]
The thorough appraisal of financial tools such as budgeting guides business leaders in effectively planning and controlling business activities for optimum productivity and profitability. Hence, proper budgeting can be used to motivate employees.
Ben-Caleb Egbide +4 more
doaj +1 more source
Minimal Positive 2-Spanning Sets of Vectors [PDF]
Let ( υ
openaire +1 more source
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties [PDF]
As usual λ(G) denotes the edge-connectivity of the graph G. It was shown in [2] that every graph G contains a spanning (λ(G)+1)-partite subgraph H such that λ(H)=λ(G) and one can find such a spanning subgraph in polynomial time.
Yeo, A.; id_orcid, Bang-Jensen, J.
core +1 more source
Untangling the causal relationship between tax burden distribution and economic growth in 23 OECD countries: Fresh evidence from linear and non-linear Granger causality [PDF]
The aim of the paper is to investigate the linear and nonlinear causality between a set of alternative tax burden ratios and economic growth in 23 OECD countries.
Sami Saafi +2 more
doaj +1 more source
Flipping Plane Spanning Paths [PDF]
Let S be a planar point set in general position, and let P(S) be the set of all plane (straight-line) spanning paths for S. A flip in a path P ∈ P(S) is the operation of removing an edge e ∈ P and replacing it with a new edge f on S such that the ...
Vogtenhuber, Birgit +7 more
core
Graphs where each spanning tree has a perfect matching
An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\\u27{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\\u27{e} set if and only if each spanning tree of $G$ has a perfect ...
Zhang, Heping, Wu, Baoyindureng
core +1 more source
Hippocampal Asymmetry Increases with Age
It is unclear whether differences between the two brain hemispheres become larger or smaller with increasing age. Given that the hippocampus is particularly susceptible to age-related changes, here, we set out to investigate the correlation between ...
Florian Kurth, Eileen Luders
doaj +1 more source
The Role of Haptics in Training and Games for Hearing-Impaired Individuals: A Systematic Review
Sensory substitution and augmentation are pivotal concepts in multi-modal perception, particularly when confronting the challenges associated with impaired or missing sense rehabilitation.
Francesco Ganis +3 more
doaj +1 more source

