Results 31 to 40 of about 41,221 (298)
Connected signed graphs L-cospectral to signed ∞-graphs
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges of G. For a signed graph we consider the Laplacian matrix defined as L=D-A, where D is the matrix of vertex degrees of G and A the (signed) adjacency ...
Brunetti, Maurizio, Belardo, Francesco
core +3 more sources
Product Signed Domination in Graphs
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . .
T M Velammal, A Nagarajan, K Palani
doaj +1 more source
More on signed graphs with at most three eigenvalues [PDF]
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertexdeleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples
StaniĆ, Zoran +4 more
core +1 more source
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source
Star complements in signed graphs with two symmetric eigenvalues
We consider signed graphs $G$ whose spectrum is comprised of exactly two (distinct) eigenvalues that differ only in sign, abbreviated to signed graphs with two symmetric eigenvalues. We obtain some relationships between such signed graphs and their star
Assoc. Prof, Zoran Stanić
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
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
Degree of an edge and Platt Number in signed networks
Positive labelled edges play a vital role in network analysis.The degree of edges in signed graphs is introduced by giving importance to positive edges incident on the end vertices of that edge. The concept of Platt number of a graph, which is the sum of
Diviya K D, Anjaly Kishore
doaj +1 more source
A study on integer additive set-valuations of signed graphs
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to\mathcal{P}(\mathbb{N}_0)\setminus ...
N.K. Sudev, K.A. Germina
doaj +1 more source
Smarandachely t-path step signed graphs [PDF]
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source
Total Minimal Dominating Signed Graph [PDF]
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source

