Results 261 to 270 of about 945,213 (292)

Structure-aware artificial intelligence for next-generation drug discovery: from protein-ligand modeling to generative biomolecular design. [PDF]

Brief Bioinform
Yoon H, Han R, Kim JW, Lee Y.
europepmc   +1 more source

Camphor-Induced Seizures in Rats Increase the Potency of Gamma Oscillations During the Ictal Period, A Component that may Lead to Refractoriness in Seizure Control. [PDF]

Neurotox Res
Hartcopff PFP, da Paz CA, Quirino LE, de Sousa Reis T, de Araujo DB, de Souza RDR, da Silva Motta CG, Araújo MFF, Dos Santos Brito MV, Dos Santos MF, Lima ABL, Lins A, Hamoy M.   +12 more
europepmc   +1 more source

Independence ratios of graph powers [PDF]

Discrete Mathematics, 1994
We investigate the limiting behaviour of the independence ratio of increasing cartesian powers of a ...
Xingxing Yu
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Power of Graph Searching for Cocomparability Graphs

SIAM Journal on Discrete Mathematics, 2016
Summary: In this paper we study how graph searching on a cocomparability graph \(G\) can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of \(\overline{G}\)) that yield simple algorithms for various intractable problems in general.
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkerhard   +3 more
openaire   +3 more sources

Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics, 2003
Summary: We give nontrivial bounds for the inductiveness or degeneracy of power graphs \(G^{k}\) of a planar graph \(G\). This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Geir Agnarsson, Magnús M. Halldórsson
openaire   +5 more sources

Graphs whose powers are chordal and graphs whose powers are interval graphs

Journal of Graph Theory, 1997
The main theorem of this paper gives a forbidden induced subgraph condition on \(G\) that is sufficient for chordality of \(G^m\). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for \(m=2\).
openaire   +3 more sources

Power graphs

J. Inf. Process. Cybern., 1994
Summary: Graphs with vertex set \(V\) can be ``lifted'' to the power set \(V^\#= {\mathcal P}(V)\backslash \{\varnothing\}\). In this paper graphs and their properties, in particular automorphisms and isomorphisms, are studied with respect to this power construction.
Ulrike Baumann, Reinhard Pöschel, Irmgard Schmeichel   +2 more
openaire   +2 more sources

The Chromatic Number of Graph Powers

Combinatorics, Probability and Computing, 2002
It is shown that the maximum possible chromatic number of the square of a graph with maximum degree d and girth g is (1 +o(1))d2 if g = 3, 4, 5 or 6, and is Θ(d2 / log d) if g [ges ] 7. Extensions to higher powers are considered as well.
Noga Alon, Bojan Mohar
openaire   +3 more sources

Unleashing the Power of Information Graphs

ACM SIGMOD Record, 2015
Information graphs are generic graphs that model different types of information through nodes and edges. Knowledge graphs are the most common type of information graphs in which nodes represent entities and edges represent relationships among them.
Matteo Lissandrini, Davide Mottin, Themis Palpanas, Dimitra Papadimitriou, Yannis Velegrakis   +4 more
openaire   +3 more sources