Results 41 to 45 of about 318 (45)
Computing the determinant of a signed graph
Open MathematicsA signed graph is a simple graph in which every edge has a positive or negative sign. In this article, we employ several algebraic techniques to compute the determinant of a signed graph in terms of the spectrum of a vertex-deleted subgraph.
Alshamary Bader, Stanić Zoran
doaj +1 more source
On the spectral distribution of large weighted random regular graphs [PDF]
, 2013 McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs.
Goldmakher, Leo +3 more
core
Equistarable graphs and counterexamples to three conjectures on equistable graphs
, 2014 Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$.
Milanič, Martin, Trotignon, Nicolas
core
Some bounds on the distance-sum-connectivity matrix. [PDF]
J Inequal Appl, 2018 Gök GK.
europepmc +1 more source
Elite Bernoulli-based mutated dung beetle algorithm for global complex problems and parameter estimation of solar photovoltaic models. [PDF]
Sci RepElhosseny M +6 more
europepmc +1 more source