Results 51 to 60 of about 41,221 (298)
Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
Complexity, 2020 A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems.
Yajing Wang, Yubin Gao
doaj +1 more source
Discrete Applied Mathematics, 1981 AbstractA signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. Psychologists are sometimes interested in the smallest number d=d(G) such that a signed graph G may be converted into a balanced graph by changing the ...
Jin Akiyama +3 more
openaire +1 more source
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
Algorithms, 2021 This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj +1 more source
Negation switching invariant signed graphs
Electronic Journal of Graph Theory and Applications, 2014 A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigraph obtained from S by reversing the sign of every ...
Deepa Sinha, Ayushi Dhama
doaj +1 more source
, 2023 This dissertation focuses on integer flow problems within specific signed graphs. The theory of integer flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color ...
Li, Chong
core +1 more source
Laplacian Spectral Characterization of Signed Sun Graphs
Theory and Applications of Graphs, 2023 A sun SGn is a graph of order 2n consisting of a cycle Cn, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra.
Fatemah Motialah +1 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
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
Constructing cospectral signed graphs
, 2021 A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) nonisomorphic graphs, known as PINGS. The work of A.J. Schwenk (in 1973) and of C. Godsil and B. McKay (in 1982) shed some light on the explanation of the
Donno A. +3 more
core +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