Results 21 to 30 of about 270,997 (279)

Heterogeneous graph convolutional neural network for protein-ligand scoring [PDF]

open access: yesExploration of Drug Science, 2023
Aim: Drug discovery is a long process, often taking decades of research endeavors. It is still an active area of research in both academic and industrial sectors with efforts on reducing time and cost.
Kevin Crampon   +4 more
doaj   +1 more source

THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER

open access: yesBarekeng, 2023
There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra   +4 more
doaj   +1 more source

Power Domination in Graphs [PDF]

open access: yes, 2020
In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process.
openaire   +3 more sources

Simplicial Powers of Graphs

open access: yesTheoretical Computer Science, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brandstädt, Andreas, Le, Van Bang
openaire   +2 more sources

GAP: Genetic Algorithm Based Large-Scale Graph Partition in Heterogeneous Cluster

open access: yesIEEE Access, 2020
Graph is an important model to describe various networks, and its scale becomes larger and larger with the development of communication and information technology.
Menghan Li   +3 more
doaj   +1 more source

A Random Graph Model for Power Law Graphs [PDF]

open access: yesExperimental Mathematics, 2001
We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. From these parameters, various properties of the
Aiello, William, Chung, Fan, Lu, Linyuan
openaire   +2 more sources

Permutational Powers of a Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2019
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Cavaleri, Matteo   +2 more
openaire   +3 more sources

Random subgraphs of certain graph powers

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2002
We determine the limiting probability that a random subgraph of the Cartesian power Kan or of Ka,an is connected.
Lane Clark
doaj   +1 more source

A Lower Bound For Depths of Powers of Edge Ideals [PDF]

open access: yes, 2015
Let $G$ be a graph and let $I$ be the edge ideal of $G$. Our main results in this article provide lower bounds for the depth of the first three powers of $I$ in terms of the diameter of $G$.
Fouli, Louiza, Morey, Susan
core   +1 more source

Average Degree in Graph Powers [PDF]

open access: yesJournal of Graph Theory, 2012
AbstractThe kth power of a simple graph G, denoted by , is the graph with vertex set where two vertices are adjacent if they are within distance k in G. We are interested in finding lower bounds on the average degree of . Here we prove that if G is connected with minimum degree and , then G4 has average degree at least .
DeVos, Matt   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy