Results 71 to 80 of about 8,004,238 (365)
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
The extreme vertices of the power graph of a group
Heliyon, 2022 For a fixed finite group G, the power graph of G was defined to be the simple graph Γ(G) whose vertex set V(Γ(G))=G, and edge set E(Γ(G))={xy: either x=yn or y=xn for some integer n}.
Omar A. AbuGhneim, Mohammed Abudayah
doaj +1 more source
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
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
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
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
FEBS Letters, EarlyView.This study reveals how prime editing guide RNA (pegRNA) secondary structure and reverse transcriptase template length affect prime editing efficiency in correcting the phospholamban R14del cardiomyopathy‐associated mutation. Insights support the design of structurally optimized enhanced pegRNAs for precise gene therapy.
Bing Yao +7 more
wiley +1 more source
Graph Neural Networks for Intelligent Transportation Systems: A Survey
IEEE transactions on intelligent transportation systems (Print), 2023 Graph neural networks (GNNs) have been extensively used in a wide variety of domains in recent years. Owing to their power in analyzing graph-structured data, they have become broadly popular in intelligent transportation systems (ITS) applications as ...
Saeed Rahmani +3 more
semanticscholar +1 more source