Results 1 to 10 of about 15,625 (297)
On colorings of graph powers [PDF]
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
Hossein Hajiabolhassan
exaly +5 more sources
A Study on the Nourishing Number of Graphs and Graph Powers [PDF]
Mathematics, 2015 Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\mathbb{N}
Sudev Naduvath, Germina Augustine
doaj +7 more sources
Clawfreeness of the powers of a graph [PDF]
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Bahls, Nicole A. Gin
exaly +4 more sources
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ.
David R. Wood
doaj +4 more sources
PepGraphormer: an ESM-GAT hybrid deep learning framework for antimicrobial peptide prediction [PDF]
Journal of CheminformaticsThe prediction of Antimicrobial Peptides (AMPs) is a critical research area in drug discovery. Traditional methods, which rely on sequence alignment or handcrafted features, often fail to capture complex sequence-function relationships.
Changhang Lin +6 more
doaj +2 more sources
A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers
Entropy, 2016 Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. The starting point has been always based on assigning a probability distribution to a network when using Shannon’s ...
Kinkar Chandra Das, Matthias Dehmer
doaj +3 more sources
On colorings of graph fractional powers
Discrete Mathematics, 2010 \noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$.
Moharram N Iradmusa
exaly +4 more sources
On incidence coloring of graph fractional powers [PDF]
Opuscula Mathematica, 2022 For any \(n\in \mathbb{N}\), the \(n\)-subdivision of a graph \(G\) is a simple graph \(G^\frac{1}{n}\) which is constructed by replacing each edge of \(G\) with a path of length \(n\). The \(m\)-th power of \(G\) is a graph, denoted by \(G^m\), with the
Mahsa Mozafari-Nia, Moharram N. Iradmusa
doaj +1 more source
On Powers of Some Graph Operations [PDF]
Mathematics Interdisciplinary Research, 2018 Let G*H be the product * of G and H. In this paper we determine the rth power of the graph G*H in terms of Gr, Hrand Gr*Hr, when * is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation
Mohamed Seoud, Hamdy Mohamed Hafez
doaj +1 more source
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hossein Hajiabolhassan, Ali Taherkhani
openaire +3 more sources