Results 51 to 60 of about 2,268 (146)
On balanced cycle domination of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a graph. A function [Formula: see text] is said to be a balanced cycle dominating function (BCDF) of [Formula: see text] if [Formula: see text] holds for any induced cycle [Formula: see text] of [Formula: see text] The balanced
Baogen Xu +3 more
doaj +1 more source
Signed degree sets in signed graphs [PDF]
Czechoslovak Mathematical Journal, 2007 The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph.
Pirzada, S., Naikoo, T. A., Dar, F. A.
openaire +2 more sources
Characterization of Line-Consistent Signed Graphs
Discussiones Mathematicae Graph Theory, 2015 The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +1 more source
Signed degree sequences of signed graphs [PDF]
Journal of Graph Theory, 1997 \textit{G. Chartrand}, \textit{H. Gavlas}, \textit{F. Harary} and \textit{M. Schultz} [Czech. Math. J. 44, No. 4, 677-690 (1994; Zbl 0837.05110)] asked whether \textit{S. L. Hakimi's} procedure [SIAM J. Appl. Math. 10, 496-506 (1962; Zbl 0109.16501)] for degree sequences in graphs also works for signed degree sequences.
Jing-Ho Yan +3 more
openaire +2 more sources
European Journal of Combinatorics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Discrete Applied MathematicsLet $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,σ)$ is a weighted graph with a special weight function $σ: E(G)\to \{-1,1\}$. A graph is sign-invertible (or sign-invertible) if its inverse
Isaiah Osborne, Dong Ye 0002
openaire +2 more sources
Signed domination numbers of directed graphs [PDF]
, 2005 summary:The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments.
Zelinka, Bohdan
core +1 more source
Computation of the eigenvalues of complete signed graphs
Electronic Journal of Graph Theory and ApplicationsA signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give
Shariefuddin Pirzada +3 more
doaj +1 more source
On the signed Italian domination of graphs [PDF]
Computer Science Journal of Moldova, 2019 A signed Italian dominating function on a graph $G=(V,E)$ is a function $f:V\to \{ -1, 1, 2 \}$ satisfying the condition that for every vertex $u$, $f[u]\ge 1$. The weight of signed Italian dominating function is the value $f(V)=\sum_{u\in V}f(u)$.
Ashraf Karamzadeh +2 more
doaj
Bipartite Consensus Problems on Second-Order Signed Networks With Heterogeneous Topologies
IEEE Access, 2020 This paper is devoted to the convergence problem for second-order signed networks that are associated with two signed graphs in the presence of heterogeneous topologies.
Jianheng Ling +2 more
doaj +1 more source