Results 91 to 100 of about 2,268 (146)

Signed total domination number of a graph [PDF]

open access: yes, 2001
summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core  

Advances in Scaling Community Discovery Methods for Signed Graph Networks

open access: yes, 2022
Community detection is a common task in social network analysis (SNA) with applications in a variety of fields including medicine, criminology, and business. Despite the popularity of community detection, there is no clear consensus on the most effective
Rusnak, Lucas   +2 more
core   +1 more source

Signing RDF Graphs [PDF]

open access: yes, 2003
Assuming P
openaire   +1 more source

S-Antipodal Signed Graphs

open access: yes, 2016
[[abstract]]In this paper we introduced a new notion S-antipodal signed graph of a signed graph and its properties are obtained. Also we give the re- lation between antipodal signed graphs and S-antipodal signed graphs.
P. Siva Kota Reddy, B. Prashanth
core  

Edge coloring of small signed graphs

open access: yesTASK Quarterly
In 2020, Behr introduced the problem of edge coloring of signed graphs and proved that every signed graph (G, sigma) can be colored using Delta(G) or Delta(G) + 1 colors, where Delta(G) denotes the maximum degree of G.
Robert Janczewski   +2 more
doaj  

An upper bound for the Laplacian index of a signed graph [PDF]

open access: yesDiscrete Mathematics Letters, 2021
Farzaneh Ramezani, Zoran Stanic
doaj   +1 more source

Offensive alliances in signed graphs

open access: yesTheoretical Computer Science
Signed graphs have been introduced to enrich graph structures expressing relationships between persons or general social entities, introducing edge signs to reflect the nature of the relationship, e.g., friendship or enmity. Independently, offensive alliances have been defined and studied for undirected, unsigned graphs.
Zhidan Feng 0002   +3 more
openaire   +2 more sources

Characterization of the maximum genus of a signed graph

open access: yes, 1991
A signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed graph is balanced if the product of signs on C is positive.
Škoviera, Martin, Širáň, Jozef
core   +1 more source

Eigenpairs of adjacency matrices of balanced signed graphs

open access: yesSpecial Matrices
In 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

具有较小秩的带号图的刻画(A characterization of signed graphs with small rank)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2013
带号图是每条边带有符号(正或负)的简单图.探讨了带号图的秩,刻画了秩为2与3的带号图,以及秩为4的带号二部图.
SULi(苏莉)   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy