Results 81 to 90 of about 586,356 (320)
Nodal domains on quantum graphs
We consider the real eigenfunctions of the Schr\"odinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds $B$.
Aurich R +25 more
core +2 more sources
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
A polynomial algorithm for the k-cluster problem on interval graphs
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well as on chordal ...
Mertzios, George B.
core +1 more source
Metformin mediates mitochondrial quality control in Leber's hereditary optic neuropathy (LHON) fibroblasts carrying mtDNA mutations. At therapeutic levels, metformin activates AMPK signaling to restore mitochondrial dynamics by promoting fusion and restraining fission, while preserving mitochondrial mass, enhancing autophagy/mitophagy and biogenesis ...
Chatnapa Panusatid +3 more
wiley +1 more source
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
A subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
Interval k-Graphs and Orders [PDF]
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes.
Brown, David E. +2 more
openaire +2 more sources
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
A Novel Study of Graphs Based on m-Polar Cubic Structures
By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin +4 more
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

