Results 61 to 70 of about 3,337,855 (342)
Graph enumeration and random graphs
, 2023 In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical ...
openaire +4 more sources
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
Veena Mathad, B. Basavanagoud
openaire +3 more sources
FEBS Letters, EarlyView.Low‐density lipoprotein receptor‐related protein 6 (LRP6) is a key receptor for the Wnt antagonist Dickkopf1 (DKK1). DKK1 protein expression is induced in a bleomycin (BLM)‐induced lung injury model. We show that DKK1 induces proinflammatory and profibrotic genes in lung fibroblasts.
Eun‐Ah Sung +6 more
wiley +1 more source
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
Revista de Matemática: Teoría y Aplicaciones, 2011 A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj +1 more source
Graph properties, graph limits and entropy [PDF]
, 2013 We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by well ...
Hatami, Hamed +2 more
core +1 more source
Spectral Graph Forge: Graph Generation Targeting Modularity
, 2018 Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure.
Baldesi, Luca +2 more
core +1 more source
FEBS Letters, EarlyView.This study explores the distinct molecular mechanisms underlying Lynch syndrome‐associated and sporadic colorectal cancer (CRC). By highlighting the therapeutic potential of targeting the PI3K‐Akt pathway in Lynch syndrome‐associated CRC and the Wnt pathway in sporadic CRC, the findings open avenues for personalised treatment strategies, aiming to ...
May J. Krause +2 more
wiley +1 more source
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
Современные информационные технологии и IT-образование, 2021 There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least .
Valentin Sysoev
doaj +1 more source
Population Protocols for Graph Class Identification Problems [PDF]
arXiv, 2021 In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication graph is a ring graph). Angluin et al.
arxiv
Learning Graph Embedding with Adversarial Training Methods
, 2019 Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction ...
Fung, Sai-fu +5 more
core +1 more source