Results 31 to 40 of about 711,822 (300)
On Laplacian Equienergetic Signed Graphs
Journal of Mathematics, 2021 The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +1 more source
Degree of an edge and Platt Number in signed networks
Ratio Mathematica, 2023 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
Karpatsʹkì Matematičnì Publìkacìï, 2015 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]
, 2010 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]
, 2010 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
Line Signed Graph of a Signed Total Graph
Electronic Notes in Discrete Mathematics, 2017 Abstract A signed total graph is an ordered pair T Σ ( Γ ( R ) ) : = ( T ( Γ ( R ) ) , σ ) , where T ( Γ ( R ) ) is the total graph of a commutative ring R, called the underlying graph of T Σ ( Γ ( R ) ) and T Σ ( Γ ( R ) ) is associated with a signing of its edges (a, b)
Mukti Acharya +3 more
openaire +2 more sources
Smarandache Directionally n-Signed Graphs — A Survey [PDF]
, 2013 For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple.
P. Siva Kota Reddy, Reddy, P.Siva Kota
core +1 more source
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Negation Switching Equivalence in Signed Graphs [PDF]
, 2010 Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core +1 more source
ON THE SIGNED MATCHINGS OF GRAPHS [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2020 For a graph $G$ and any $v\in V(G)$, $E_{G}(v)$ is the set of all edges incident with $v$. A function $f:E(G)\rightarrow \{-1,1\}$ is called a signed matching of $G$ if $\sum_{e\in E(v)}f(e) \leq 1$ for every $ {v\in V(G)}$. For a signed matching $x$, set $x(E(G))=\sum_{e\in E(G))}x(e)$.
Javan, Samane, Maimani, Hamid Reza
openaire +2 more sources