Results 51 to 57 of about 359 (57)

Computing the determinant of a signed graph

Open Mathematics
A 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

Evaluating balancing on social networks through the efficient solution of correlation clustering problems

EURO Journal on Computational Optimization, 2017
One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state.
Mario Levorato, Rosa Figueiredo, Yuri Frota, Lúcia Drummond   +3 more
doaj  

Skew-signings of positive weighted digraphs

Arab Journal of Mathematical Sciences, 2018
An arc-weighted digraph is a pair (D , ω) where D is a digraph and ω is an arc-weight function that assigns to each arc u v of D a nonzero real number ω (u v) .
Kawtar Attas, Abderrahim Boussaïri, Mohamed Zaidi   +2 more
doaj  

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

Some of the next articles are maybe not open access.

Related searches:

EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

, 2020
A labeling of a graph G with α vertices and β edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum mod (2γ) of labels of edge incident on it ...
B. Ambika, G. Balasubramanian
semanticscholar   +1 more source

A Note on the Fundamental Groups and Covers of Lattice Walk

, 2014
This paper illustrates how covering spaces of graphs may aid analyses of lattice walks. Elements involved in the presentation are trees in graphs, Euler numbers, free generators, group of covering transformations and actions, wedge of circles, and ...
G. Light
semanticscholar   +1 more source