On Lict sigraphs
A signed graph (marked graph) is an ordered pair $S=(G,sigma)$ $(S=(G,mu))$, where $G=(V,E)$ is a graph called the underlying graph of $S$ and $sigma:Erightarrow{+,-}$ $(mu:Vrightarrow{+,-})$ is a function. For a graph $G$, $V(G), E(G)$ and $C(G)$ denote its vertex set, edge set and cut-vertex...
Main Author: | Kishori P. Narayankar |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2014-12-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/pdf_5627_e7de2aef7c26e21d97bfaf79f2112406.html |
Similar Items
-
On •-Line Signed Graphs L•(S)
by: Sinha Deepa, et al.
Published: (2015-05-01) -
Negation switching invariant signed graphs
by: Deepa Sinha, et al.
Published: (2014-04-01) -
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$
by: Mukti Acharya, et al.
Published: (2016-03-01) -
Secure Domination in Lict Graphs
by: Girish V. Rajasekharaiah, et al.
Published: (2018-06-01) -
Certain topological indices and polynomials for the semitotal-point graph and line graph of semitotal-point graph for Dutch windmill graph
by: Salma Kanwal, et al.
Published: (2020-01-01)