Results 31 to 40 of about 15,625 (297)
Portable Graph Layout and Editing [PDF]
, 1996 The Graph Layout Toolkit and the Graph Editor Toolkit are portable, flexible toolkits for graph layout and graph editing systems. The Graph Layout Toolkit contains four highly customizable layout algorithms, and supports hierarchical graphs.
Himsolt, Michael +3 more
core +1 more source
Random subgraphs of certain graph powers
International 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
Carving up the network of powers [PDF]
, 2023 Do powers have parts? Mereological thinking is typically guided by two different metaphors: building vs. carving. The building picture treats wholes as constructed from fundamental bits; the carving treats wholes as the result of carving some ...
Cotnoir, A. J.
core +1 more source
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
Graph Powering and Spectral Robustness
SIAM Journal on Mathematics of Data Science, 2020 Spectral algorithms, such as principal component analysis and spectral clustering, typically require careful data transformations to be effective: upon observing a matrix $A$, one may look at the spectrum of $ψ(A)$ for a properly chosen $ψ$. The issue is that the spectrum of $A$ might be contaminated by non-informational top eigenvalues, e.g., due to ...
Emmanuel Abbe +3 more
openaire +2 more sources
Quotient graphs for power graphs [PDF]
Rendiconti del Seminario Matematico della Università di Padova, 2017 In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G ...
BUBBOLONI, DANIELA +2 more
openaire +3 more sources
Measure preserving homomorphisms and independent sets in tensor graph powers [PDF]
, 2008 In this note, we study the behavior of independent sets of maximum probability measure in tensor graph powers. To do this, we introduce an upper bound using measure preserving homomorphisms. This work extends some previous results concerning independence
Hatami, Pooya +3 more
core +1 more source
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
d-Path Laplacians and Quantum Transport on Graphs
Mathematics, 2020 We generalize the Schrödinger equation on graphs to include long-range interactions (LRI) by means of the Mellin-transformed d-path Laplacian operators.
Ernesto Estrada
doaj +1 more source
Regularity of bicyclic graphs and their powers [PDF]
Journal of Algebra and Its Applications, 2019 Let [Formula: see text] be the edge ideal of a bicyclic graph [Formula: see text] with a dumbbell as the base graph. In this paper, we characterize the Castelnuovo–Mumford regularity of [Formula: see text] in terms of the induced matching number of [Formula: see text]. For the base case of this family of graphs, i.e.
Cid-Ruiz, Yairon +3 more
openaire +4 more sources