Results 41 to 50 of about 29,610 (306)

On Strongly Regular Graphs and the Friendship Theorem

Mathematics
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj   +1 more source

Strongly Regular Graphs from Weakly Regular Plateaued Functions [PDF]

2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019
The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs from weakly regular bent functions given by Chee et al.
Mesnager, Sihem, Sinak, Ahmet
openaire   +3 more sources

Some new models for multiprocessor interconnection networks [PDF]

Yugoslav Journal of Operations Research, 2016
A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply ...
Cvetković Dragoš, Davidović Tatjana, Jovanović Irena M.   +2 more
doaj   +1 more source

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

FEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai, Mizuki Seo, Gyath Karadsheh, Fachrur Rizal Mahendra, Máté Á Demény, Ferenc Győry, János András Mótyán, László Fésüs, Endre Kristóf, Rini Arianti   +9 more
wiley   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

FEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto, Yukio Matsuba, Mika Takahashi, Takaomi C. Saido   +3 more
wiley   +1 more source

Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs

AKCE International Journal of Graphs and Combinatorics
The block graph of a quasi-symmetric design is strongly regular. It is a challenging problem to decide which strongly regular graphs are block graphs of quasi-symmetric designs.
Kusum S. Rajbhar, Rajendra M. Pawale
doaj   +1 more source

Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells

Molecular Oncology, EarlyView.
Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son, Lily L. Remsing Rix, Bin Fang, Eric A. Welsh, Nicole V. Bremer, Valentina Foglizzo, Paola Roa, Nickole Sigcha‐Coello, Yi Liao, Eric B. Haura, Alexander Drilon, John M. Koomen, Emiliano Cocco, Uwe Rix   +13 more
wiley   +1 more source

Complete Weight Enumerators of a Class of Linear Codes From Weil Sums

IEEE Access, 2020
By appropriately choosing a defining set, we define a class of linear codes and determine their complete weight enumerators and weight enumerators using Weil sums.
Shudi Yang
doaj   +1 more source

Homomorphisms of strongly regular graphs [PDF]

Algebraic Combinatorics, 2016
We prove that if G and H are primitive strongly regular graphs with the same parameters and φ is a homomorphism from G to H, then φ is either an isomorphism or a coloring (homomorphism to a complete subgraph). Moreover, any such coloring is optimal for G and its image is a maximum clique of H.
openaire   +4 more sources

On highly regular strongly regular graphs [PDF]

Algebraic Combinatorics, 2021
In this paper we unify several existing regularity conditions for graphs, including strong regularity, k-isoregularity, and the t-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using our theoretical results we show that a family of non rank 3 graphs known to satisfy the 7-vertex condition fulfills ...
openaire   +3 more sources