Results 31 to 40 of about 352 (69)
Eigenpairs of adjacency matrices of balanced signed graphs
Special MatricesIn this article, we study eigenvalues λ\lambda and their associated eigenvectors xx of the adjacency matrices AA of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology ...
Chen Mei-Qin
doaj +1 more source
On the weights of simple paths in weighted complete graphs
, 2012 Consider a weighted graph G with n vertices, numbered by the set {1,...,n}. For any path p in G, we call w_G(p) the sum of the weights of the edges of the path and we define the multiset {\cal D}_{i,j} (G) = {w_G(p) | p simple path between i and j} We ...
Rubei, Elena
core +2 more sources
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 more sources
Orientable ℤN-Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
Cichacz Sylwia +2 more
doaj +1 more source
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 +3 more
doaj +1 more source
The Gap Number of the T-Tetromino
, 2014 A famous result of D. Walkup states that the only rectangles that may be tiled by the T-tetromino are those in which both sides are a multiple of four. In this paper we examine the rest of the rectangles, asking how many T-tetrominos may be placed into ...
Hochberg, Robert
core +1 more source
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 +2 more
doaj +1 more source
Kontsevich's star-product up to order 7 for affine Poisson brackets: where are the Riemann zeta values? [PDF]
Open Communications in Nonlinear Mathematical PhysicsThe Kontsevich star-product admits a well-defined restriction to the class of affine -- in particular, linear -- Poisson brackets; its graph expansion consists only of Kontsevich's graphs with in-degree $\leqslant 1$ for aerial vertices.
Ricardo Buring, Arthemy V. Kiselev
doaj +1 more source
Eigenvalues of complex unit gain graphs and gain regularity
Special MatricesA complex unit gain graph (or T{\mathbb{T}}-gain graph) Γ=(G,γ)\Gamma =\left(G,\gamma ) is a gain graph with gains in T{\mathbb{T}}, the multiplicative group of complex units.
Brunetti Maurizio
doaj +1 more source
Relations between connected and self-avoiding walks in a digraph [PDF]
, 2015 Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding hikes.
Espinasse, Thibault, Rochet, Paul
core +3 more sources