Results 21 to 30 of about 5,865,138 (250)
Graph Powering and Spectral Robustness
SIAM Journal on Mathematics of Data Science, 2020 Spectral algorithms, such as principal component analysis and spectral clustering, rely on the extremal eigenpairs of a matrix $A$. However, these may be uninformative without preprocessing $A$ with a proper transformation. The reason is that the spectrum of $A$ may be contaminated by top eigenvalues resulting from scale variations in the data, such as
Abbe, Emmanuel +3 more
openaire +2 more sources
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Ars Mathematica Contemporanea, 2010 Summary: We define a new graph operation called the \(k\)th inner power. The construction-which is somewhat analogous to the \(k\)th power with respect to the direct product-seems to lend itself nicely to certain questions concerning cancellation over the direct product.
Richard H. Hammack, Neal Livesay
openaire +3 more sources
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
Clawfreeness of the powers of a graph
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Bahls, Nicole A. Gin
openaire +2 more sources
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +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
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
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
Directed graph iterated function systems [PDF]
, 2011 This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core +2 more sources