Results 71 to 80 of about 2,268 (146)
Edge-Dual Graph Preserving Sign Prediction for Signed Social Networks
IEEE Access, 2017 Though existing works of sign prediction have reasonable prediction performances, they suffer from the data sparseness problem, especially for the negative link prediction.
Weiwei Yuan +3 more
doaj +1 more source
Signed star (k,k)-domatic number of a graph [PDF]
Opuscula Mathematica, 2014 Let \(G\) be a simple graph without isolated vertices with vertex set \(V(G)\) and edge set \(E(G)\) and let \(k\) be a positive integer. A function \(f:E(G)\longrightarrow \{-1, 1\}\) is said to be a signed star \(k\)-dominating function on \(G\) if ...
S. M. Sheikholeslami, L. Volkmann
doaj +1 more source
On the Powers of Signed Graphs
, 2020 A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
T V, Shijin, K A, Germina, K, Shahul
openaire +2 more sources
Ural Mathematical Journal, 2020 In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of \(rna\) number is revisited and an important relation between the number and its complement is established.
Athira P. Ranjith +1 more
openaire +4 more sources
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
Discrete Applied Mathematics, 1980 AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear systems is introduced. Several results are obtained concerning the structure of such graphs. Also an application is made revealing much of the structure of matrices of sign-solvable systems.
openaire +1 more source
On equienergetic signed graphs
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mushtaq A. Bhat, Shariefuddin Pirzada
openaire +2 more sources
On signed degrees in signed graphs [PDF]
Czechoslovak Mathematical Journal, 1994 A graph is called signed if there is a designation of its edges as either positive or negative. The signed degree of a vertex \(v\) is the number of positive edges through \(v\) less the number of negative edges through \(v\). The degree sequence consists of signed degrees of all vertices in nonincreasing order.
Chartrand, Gary +3 more
openaire +2 more sources
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Laplacian Spectral Properties of Signed Circular Caterpillars
Theory and Applications of Graphs, 2020 A circular caterpillar of girth $n$ is a graph such that the removal of all pendant vertices yields a cycle $C_n$ of order $n$. A signed graph is a pair $\Gamma=(G, \sigma)$, where $G$ is a simple graph and $\sigma: E(G) \rightarrow \{+1, -1\}$ is the ...
Maurizio Brunetti
doaj +1 more source