Results 271 to 280 of about 945,213 (292)

On the power graph and the reduced power graph of a finite group

Communications in Algebra, 2019
In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph).
T. Anitha, R. Rajkumar
openaire   +1 more source

Powers of graphs

Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire   +1 more source

Coloring Powers of Chordal Graphs

SIAM Journal on Discrete Mathematics, 2004
Summary: We prove that the \(k\)th power \(G^{k}\) of a chordal graph \(G\) with maximum degree \(\Delta\) is \(O(\sqrt{k}\Delta^{(k+1)/2})\)-degenerate for even values of \(k\) and \(O(\Delta^{(k+1)/2})\)-degenerate for odd values. In particular, this bounds the chromatic number \(\chi(G^k)\) of the \(k\)th power of \(G\).
openaire   +2 more sources

Comparing the Power of Games on Graphs

Mathematical Logic Quarterly, 1997
AbstractThe descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in
openaire   +1 more source

Applying Power Graph Analysis to Weighted Graphs

2012
We expanded Power Graph Analysis for use with weighted graphs, applying the technique to document categorisation with promising results. With the additional weight information we were able to create more accurate representations of the underlying data while maintaining a high level of edge reduction and improving visualisation of the graph.
openaire   +1 more source

Cliques in exact distance powers of graphs of given maximum degree

Procedia Computer Science, 2021
Reza Naserasr, Florent Foucaud
exaly  

Number of walks and degree powers in a graph

Discrete Mathematics, 2009
E Garriga, M A Fiol
exaly  

The Shannon capacity of a graph and the independence numbers of its powers

IEEE Transactions on Information Theory, 2006
N Alon
exaly  

Independent sets in tensor graph powers

Journal of Graph Theory, 2007
Eyal Lubetzky
exaly  

Mim-width III. Graph powers and generalized distance domination problems

Theoretical Computer Science, 2019
Torstein J F Strømme, Jan Arne Telle, O-Joung Kwon   +2 more
exaly