Results 51 to 60 of about 423,962 (267)
Discussiones Mathematicae Graph Theory, 2021 Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj +1 more source
Character degree graphs that are complete graphs [PDF]
Proceedings of the American Mathematical Society, 2006 Let \(G\) be a finite group and let \(\text{cd}(G)\) denote the different integers which occur as the degrees of the irreducible complex characters of \(G\). Let \(\Gamma(G)\) be the graph whose vertex set is \(\text{cd}(G)-\{1\}\). An edge joins two vertices represented by positive integers \(a\) and \(b\) if \(\gcd(a,b)>1\). The authors prove that if
M. Bianchi +3 more
openaire +4 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Modular irregularity strength of dense graphs
Electronic Journal of Graph Theory and ApplicationsWe solve the open problem posed in Modular irregularity strength of graphs, Electron. J. Graph Theory and Appl. 8 (2020), 435–433, asking about the modular irregularity strength of the complete graph Kn for all n ≥ 3.
I Nengah Suparta +3 more
doaj +1 more source
Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network
FEBS Letters, EarlyView.Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley +1 more source
Computation of the eigenvalues of complete signed graphs
Electronic Journal of Graph Theory and ApplicationsA signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada +3 more
doaj +1 more source
The ramsey number for theta graph versus a clique of order three and four
Discussiones Mathematicae Graph Theory, 2014 For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph.
Bataineh M.S.A. +2 more
doaj +1 more source
Discrete Mathematics, 1998 Let \(G\) be a simple graph. The clique graph \(K(G)\) is the intersection graph of the maximal cliques of \(G\). A vertex in \(G\) is universal if it is adjacent to all other vertices in \(G\). The \(n\)th iterated clique graph of \(G\) is defined by \(K^{(n)}= K(K^{n-1} (G))\) and \(G\) is \(n\)-convergent if \(K^n (G)\) is isomorphic to the one ...
Cláudio Leonardo Lucchesi +2 more
openaire +2 more sources
FEBS Letters, EarlyView.Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante +10 more
wiley +1 more source
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
Fokus, 2016 This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin
Novia Rahmawati
doaj +1 more source