Results 51 to 60 of about 1,307,438 (325)
Discrete Mathematics, 2009 In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose $(2t+1)$st power is bounded by a Kneser graph. Also, we consider the problem of existence of homomorphism to odd cycles. We prove that such
openaire +2 more sources
Analysis of the Web Graph Aggregated by Host and Pay-Level Domain
, 2018 In this paper the web is analyzed as a graph aggregated by host and pay-level domain (PLD). The web graph datasets, publicly available, have been released by the Common Crawl Foundation and are based on a web crawl performed during the period May-June ...
A Barabasi +4 more
core +2 more sources
Discrete Mathematics, 2006 AbstractThe problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 1998, Haynes et al. considered the graph theoretical representation of this problem as a variation of the domination problem.
Zhao, M., Kang, L. Y., Chang, G. J.
openaire +2 more sources
Zhongguo dianliAs the widespread integration of new energy and interconnection of large power grids, the operation modes of power systems are undergoing transformations, which leads to a fast surge in data volumes and higher demands for real-time information processing,
Pei ZHANG +8 more
doaj +1 more source
From omics to AI—mapping the pathogenic pathways in type 2 diabetes
FEBS Letters, EarlyView.Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan +2 more
wiley +1 more source
Automorphism group of certain power graphs of finite groups
Electronic Journal of Graph Theory and Applications, 2017 The power graph $\mathcal{P}(G)$ of a group $G$ is the graphwith group elements as vertex set and two elements areadjacent if one is a power of the other. The aim of this paper is to compute the automorphism group of the power graph of several well-known
Ali Reza Ashrafi +2 more
doaj +1 more source
Boxicity and Cubicity of Product Graphs
, 2013 The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$.
Chandran, L. Sunil +3 more
core +1 more source
Graph Powering and Spectral Robustness [PDF]
SIAM Journal on Mathematics of Data Science, 2020 Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix $A$, one may look at the spectrum of $ (A)$ for a properly chosen $ $. The issue is that the spectrum of $A$ might be contaminated by non-informational top eigenvalues, e.g., due to
Emmanuel Abbe +3 more
openaire +3 more sources
FEBS Letters, EarlyView.Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile +8 more
wiley +1 more source
Forbidden subgraphs in reduced power graphs of finite groups
AIMS Mathematics, 2021 Let G be a finite group. The reduced power graph of G is the undirected graph whose vertex set consists of all elements of G, and two distinct vertices x and y are adjacent if either ⟨x⟩⊂⟨y⟩ or ⟨y⟩⊂⟨x⟩. In this paper, we show that the reduced power graph
Huani Li , Ruiqin Fu, Xuanlong Ma
doaj +1 more source