Results 101 to 110 of about 507,111 (281)
Automorphism Groups of Covering Graphs
Journal of Combinatorial Theory, Series B, 1997 For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1/2-transitive and 1-regular graphs.
Seifter, Norbert, Trofimov, Vladimir I.
openaire +2 more sources
Arthritis Care &Research, EarlyView.Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo +88 more
wiley +1 more source
Associations of Sleep and Shift Work With Osteoarthritis Risk
Arthritis Care &Research, EarlyView.Objective Daily rhythms may be critical for maintaining homeostasis of joint tissues. We aimed to investigate the relationships among circadian clock disruption, sleep, and osteoarthritis (OA) risk in humans. Methods In the UK Biobank, a prospective 500,000–person cohort, we evaluated associations among sleep duration, sleeplessness/insomnia, and shift
Elizabeth L. Yanik +5 more
wiley +1 more source
Super (a, d)-H-antimagic labeling of subdivided graphs
Open Mathematics, 2018 A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G isomorphic to H. A graph G admitting an H-covering is called an (a, d)-H-antimagic if there exists a bijective function f : V(G) ∪ E(G) → {1, 2, …, |V(G)| + |
Taimur Amir +4 more
doaj +1 more source
Bounds for the Laplacian spectral radius of graphs
Electronic Journal of Graph Theory and Applications, 2017 This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph.
Kamal Lochan Patra, Binod Kumar Sahoo
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1974 AbstractA graph Γ of valency k with a group G of automorphisms may be studied via the action of G on the vertex set VΓ. If G acts transitively on VΓ, then the notions of primitivity and imprimitivity are meaningful. We consider a natural notion of “block system” for a general graph Γ, which allows us to derive a “quotient” graph Γ whose vertices ...
openaire +1 more source
Retractions in Rheumatology: Trends, Causes, and Implications for Research Integrity
Arthritis Care &Research, EarlyView.Objective We aimed to describe the trends and main reasons for study retraction in rheumatology literature. Methods We reviewed the Retraction Watch database to identify retracted articles in rheumatology. We recorded the main study characteristics, authors’ countries, reasons for retraction, time from publication to retraction, and trends over time ...
Anna Maria Vettori, Michele Iudici
wiley +1 more source
Bounds for graph energy in terms of vertex covering and clique numbers
Electronic Journal of Graph Theory and Applications, 2019 Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣.
Hilal A. Ganie +3 more
doaj +1 more source
Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control
Advanced Engineering Materials, EarlyView.This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian +4 more
wiley +1 more source
On Leighton’s graph covering theorem
Groups, Geometry, and Dynamics, 2010 We give short expositions of both Leighton’s proof and the Bass–Kulkarni proof of Leighton’s graph covering theorem, in the context of colored graphs. We discuss a further generalization, needed elsewhere, to “symmetry-restricted graphs”. We can prove it in some cases, for example, if the “graph of colors” is a tree, but we do not know if it is true in
openaire +4 more sources