Results 41 to 50 of about 15,625 (297)
On the conjunctive capacity of graphs [PDF]
, 2013 The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka +5 more
core +1 more source
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones Mathematicae Graph Theory, 2016 We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source
(Generalized) Incidence and Laplacian-Like Energies
Journal of Mathematics, 2023 In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε≠0,1, we found generalized and improved bounds for the sum of ε-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj +1 more source
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +3 more
openaire +2 more sources
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences [PDF]
Logical Methods in Computer Science, 2015 Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary function of r and ...
Jakub Gajarsky, Petr Hlineny
doaj +1 more source
Power Domination in Graphs [PDF]
, 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
Chained graphs and some applications
Applied Network Science, 2021 This paper introduces the notions of chained and semi-chained graphs. The chain of a graph, when existent, refines the notion of bipartivity and conveys important structural information. Also the notion of a center vertex $$v_c$$ v c is introduced. It is
Anna Concas +3 more
doaj +1 more source
On the Powers of Signed Graphs
, 2020 A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
T V, Shijin, K A, Germina, K, Shahul
openaire +2 more sources
Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms [PDF]
, 2009 Given a graph H = (V_H,E_H) and a positive integer k, the k-th power of H, written H^k, is the graph obtained from H by adding edges between any pair of vertices at distance at most k in H; formally, H^k = (V_H, {xy | 1
Nguyen, Ngoc Tuy (gnd: 140242341)
core +1 more source
Graph neural networks for prediction of protein isoelectric points [PDF]
, 2022 Graph neural networks were used to model protein isoelectric points. Predictions contained markedly fewer outliers (predicted with errors > 0.5 pH units) compared to tools published in the literature, despite slightly higher root-mean-squared errors ...
Tom, Brenner
core +1 more source