Results 31 to 40 of about 1,356,811 (224)
A Random Graph Model for Power Law Graphs [PDF]
Experimental 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
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
Real Quadratic-Form-Based Graph Pooling for Graph Neural Networks
Machine Learning and Knowledge Extraction, 2022 Graph neural networks (GNNs) have developed rapidly in recent years because they can work over non-Euclidean data and possess promising prediction power in many real-word applications.
Youfa Liu, Guo Chen
doaj +1 more source
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs [PDF]
, 2013 Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules.
Dwyer, Tim +5 more
core +1 more source
Permutational Powers of a Graph [PDF]
The 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
SHACL-Based Validation Method of Knowledge Graph for Power System Model
Zhongguo dianli, 2022 With the expansion of the power grid and the high penetration of distributed energy resources, the power system analysis and decision-making have put forward higher requirements for comprehensive and accurate power grid models.
Xiaolu LI +5 more
doaj +1 more source
Average Degree in Graph Powers [PDF]
Journal 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
Power domination in Kn\"odel graphs and Hanoi graphs
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varghese, Seethu +2 more
openaire +3 more sources
Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]
Mathematics Interdisciplinary Research, 2020 In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Asma Hamzeh
doaj +1 more source
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Journal of Mathematics, 2023 A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source