The order difference interval graph of a group [PDF]
In this paper we introduce the concept of order difference interval graph ¡ODI (G) of a group G. It is a graph ¡ODI (G) with V (¡ODI (G)) = G and two vertices a and b are adjacent in ¡ODI (G) if and only if o(b) − o(a) ∈ [o(a), o(b)].
P. Balakrishnan, R. Kala
doaj
A Reduction of the Graph Reconstruction Conjecture
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In
Monikandan S., Balakumar J.
doaj +1 more source
Interval graphs and interval orders
This paper investigates the connection between interval graphs and interval orders, with special attention to the family of interval orders that agree with or provide representations of an interval graph. Relationships between interval graphs and interval orders that concern the number of lengths required for interval representations and bounds on ...
openaire +1 more source
Purkinje Cell Loss in Essential Tremor: Collective Data From 215 Brains Over a 21‐Year Period
ABSTRACT Objective Essential tremor is a highly prevalent movement disorder. Pathological changes observed in essential tremor cerebella center around Purkinje cells and neighboring neuronal populations. Postmortem studies have variably, but not always, shown reduced Purkinje cell counts in essential tremor compared to controls.
Chloë A. Kerridge +4 more
wiley +1 more source
Interval edge colorings of the generalized lexicographic product of some graphs
An edge-coloring of a graph $ G $ with colors $ 1, \ldots, t $ is an interval $ t $-coloring if all colors are used and the colors of edges incident to each vertex of $ G $ are distinct and form an interval of integers.
Meiqin Jin , Ping Chen, Shuangliang Tian
doaj +1 more source
A characterization of the Total Graph of Interval Graphs and Proper Interval Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighbourhood of the third vertex. Let G be a graph with vertex set V (G) and edge set E(G), the total graph T(G) of G has vertex set V (G)∪E(G) and two vertices in T(G) are adjacent if and only if they are adjacent or incident in G.
Athul T B, G Suresh Singh
openaire +1 more source
Expanding Hereditary Spastic Paraplegias Limits: Biallelic SPAST Variants in Cerebral Palsy Mimics
ABSTRACT Objective Hereditary spastic paraplegias (HSP) are rare neurodegenerative disorders marked by spasticity and lower limb weakness. The most common type, SPG4, is usually autosomal dominant and caused by SPAST gene variants, typically presenting as pure HSP.
Gregorio A. Nolasco +18 more
wiley +1 more source
Determining the shortest path on an intuitionistic fuzzy graph with interval value using floyd Warshall algorithm [PDF]
Nahlia Rakhmawati +3 more
openalex +1 more source
Decreased Serum 5‐HT: Clinical Correlates and Regulatory Role in NMJ of MG
ABSTRACT Objective Although 5‐Hydroxytryptamine (5‐HT) indirectly stimulates muscle contraction and participates in regulating Acetylcholine receptor (AChR) cluster homeostasis in cellular, animal, and clinical studies, evidence regarding its potential to modulate muscle contraction in myasthenia gravis (MG) remains limited.
Xinru Shen +18 more
wiley +1 more source
SHORTEST PATH ON INTERVAL-VALUED INTUITIONISTIC TRAPEZOIDAL NEUTROSOPHIC FUZZY GRAPHS WITH APPLICATION [PDF]
K. Kalaiarasi, R. Divya
openalex +1 more source

