Results 81 to 90 of about 1,962 (215)
On Mostar and Edge Mostar Indices of Graphs
Journal of Mathematics, 2021 Let G be a graph with edge set EG and e=uv∈EG. Define nue,G and mue,G to be the number of vertices of G closer to u than to v and the number of edges of G closer to u than to v, respectively. The numbers nve,G and mve,G can be defined in an analogous way.
Ali Ghalavand +2 more
doaj +1 more source
Developmental Medicine &Child Neurology, EarlyView.Safety strategies used by adults with complex forms of cerebral palsy when participating in community‐based physical activity were explored in this study. Physical assistance was the main safety strategy in use, provided for four key purposes. The attributes of support people in community settings was key to experiences of safety.
Georgia B McKenzie +6 more
wiley +1 more source
A Conversation With David Bellhouse
International Statistical Review, EarlyView.Summary David Richard Bellhouse was born in Winnipeg, Manitoba, on 19 July 1948. He studied actuarial mathematics and statistics at the University of Manitoba (BA, 1970; MA, 1972) and completed his PhD at the University of Waterloo, Ontario, in 1975. After being an Assistant Professor for 1 year at his alma mater, he joined the University of Western ...
Christian Genest
wiley +1 more source
The Lowest Total Irregularity of a Completely Segregated ?-Bicyclic Graph
, 2016 A simple linked graph with exactly the same number of edges as vertices plus one is called a bicyclic graph. A completely segregated bicyclic network is one in which any two neighboring vertices have different degrees.
Mahadevaswamy B.S.
core
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Bicyclic graphs for which the least eigenvalue is minimum
, 2009 The spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic ...
Aleksić, Tatjana +2 more
core +1 more source
Computing the determinant of a signed graph
Open MathematicsA signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj +1 more source
Embedding mental files in the world
Mind &Language, EarlyView.Cognitive scientific explanations can take either a mechanistic or design perspective. Some recent philosophical works propose to apply the mechanistic perspective to the influential mental file framework. The design perspective, however, remains underexplored.
Zhengxi Jin
wiley +1 more source
Bicyclic graphs with exactly two main eigenvalues
, 2009 An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular.
Hu, Zhiquan, Li, Shuchao, Zhu, Chunfeng
core +1 more source
Experimental Physiology, EarlyView.Abstract Prolonged exposure to weightlessness leads to loss of muscle and bone mass. Therefore, astronauts on board the International Space Station (ISS) currently perform mandatory daily exercises. ISS missions usually last 6 months, and future missions will become significantly longer when going, for example, to Mars.
Jonas Böcker +6 more
wiley +1 more source