Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,153,142 papers from all fields of science
Search
Sign In
Create Free Account
Signed graph
Known as:
Signed graphs
In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign. Two fundamental questions…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Adjacency matrix
Balance theory
Biased graph
Bidirected graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Forbidden subgraph characterizations of extensions of anti-gallai graph operator to signed graph
Jeepamol J. Palathingal
,
S. AparnaLakshmanan
AIP Conference Proceedings
2017
Corpus ID: 43641261
We introduce three types of extension of Gallai gra ph operator in to signed graphsGallai signed graph, product-Gallai signed…
Expand
Review
2014
Review
2014
A Survey on Selection Techniques of Component Based Software
Nitish Madaan
,
J. Kaur
2014
Corpus ID: 14505767
Component-based software engineering (CBSE) is an approach to develop software that relies on software reuse. The success of the…
Expand
2010
2010
The Edge C4 Signed Graph of a Signed Graph
R. Rangarajan
,
P. Reddy
2010
Corpus ID: 117887441
A signed graph (marked graph) is an ordered pair S = (G, �) (S = (G, �)), where G = (V,E) is a graph called the underlying graph…
Expand
2010
2010
Frustration vs . Clusterability in Two-Mode Signed Networks ( Signed Bipartite Graphs )
T. Zaslavsky
2010
Corpus ID: 946660
Mrvar and Doreian recently defined a notion of bipartite clustering in bipartite signed graphs that gives a measure of imbalance…
Expand
2009
2009
Triangular line signed graph of a signed graph
M. S. Subramanya
,
P. Reddy
2009
Corpus ID: 119079358
A signed graph (marked graph) is an ordered pair S=(G,σ) (S=(G,μ)), where G=(V,E) is a graph called the underlying graph of S and…
Expand
2008
2008
Parallel complexity of signed graphs for gene assembly in ciliates
T. Harju
,
Chang Li
,
I. Petre
Soft Computing - A Fusion of Foundations…
2008
Corpus ID: 12481693
We consider a graph-based model for the study of parallelism in ciliate gene assembly, where a signed graph is associated to each…
Expand
2007
2007
COMPLEXITY OF GRAPH POLYNOMIALS
S. Noble
2007
Corpus ID: 115852129
This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and…
Expand
2007
2007
Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Workshop on Engineering Applications
2007
Corpus ID: 262352696
Book file PDF easily for everyone and every device. You can download and read online Experimental Algorithms: 6th International…
Expand
1997
1997
A characterization of supersolvable signed graphs
Young-Jin Yoon
1997
Corpus ID: 118349407
We characterize supersolvable signed graphs by using simplicial nodes and some signed graphs $\Delta_2, L_k$.
Review
1991
Review
1991
Tables of signed graphs
Fc Frans Bussemaker
,
P. Cameron
,
J. Seidel
,
S. V. Tsaranov
1991
Corpus ID: 109047188
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required