Results 91 to 100 of about 5,978,611 (274)
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source
We establish a systematic algebraic and geometric framework generated from the zero–one scanning tables of finite simple graphs. For a graph $G$ and a $k$-vertex set $U$, the table of all $k!$ orderings of $U$ yields, via an adjacency-or-self scanning rule, a family of binary tables.
wang, Jianming, Wang, Jianming
openaire +2 more sources
Tits alternatives for graph products
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group satisfies this ...
Antolin, Yago, Minasyan, Ashot
core +1 more source
Fast, exact graph diameter computation with vertex programming [PDF]
In graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, insomuch that approximation ...
Corey Pennycuff +3 more
core +1 more source
Sleep disturbance severity closely tracks hearing loss in a clinical cohort, yet the mechanistic link remains unclear. Acute sleep deprivation is shown to trigger transient cochlear oxidative stress that switches into a self‐sustaining neuroinflammatory state, suppressing BK channels and causing irreversible synaptopathy.
Dan Chen +11 more
wiley +1 more source
Distributed Graph Simulation: Impossibility and Possibility [PDF]
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
A new class of lysosome‐directed molecular glue degraders selectively enhance CAPRIN1–APP interactions, driving APP degradation and reducing amyloid‐β production in human neurons and Alzheimer's disease mouse models. This CAPRIN1‐dependent targeted protein degradation strategy reveals a previously unrecognized therapeutic approach for disrupting the ...
Sunghan Jung +15 more
wiley +1 more source
Structural Divergence Between the Moltbook AI‐Agent Network and Human Social Networks
Analysis of the Moltbook AI‐agent network reveals a striking combination of familiar global scaling and distinct internal organization. Attention is highly concentrated, reciprocity is limited, connected triads are suppressed, and communities are strongly modular.
Wenpin Hou, Zhicheng Ji
wiley +1 more source
Sum-edge characteristic polynomials of graphs
Modelling a chemical compound by a (molecular) graph helps us to obtain some required information about the chemical and physical properties of the corresponding molecular structure.
Mert Sinan Oz +2 more
doaj +1 more source

