Results 1 to 10 of about 34,755 (248)

Embedding signed graphs in the line

Journal of Combinatorial Optimization, 2013
Signed graphs are graphs with an assignment of a positive or a negative sign to each edge. These graphs are helpful to represent different types of networks. For instance, they have been used in social networks, where a positive sign in an edge represents friendship between the two endpoints of that edge, while a negative sign represents enmity.
Eduardo G. Pardo, Mauricio Soto, Christopher Thraves   +2 more
openaire   +2 more sources

Characterization of Signed Graphs Whose Iterated Signed Line Graphs are Balanced or S-Consistent

Bulletin of the Malaysian Mathematical Sciences Society, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deepa Sinha, Mukti Acharya, Sinha Deepa   +2 more
exaly   +3 more sources

C-consistent line signed graphs of Cayley signed graphs

Journal of Interdisciplinary Mathematics, 2023
The Cayley graph, signed graph and line graph are well known in the literature. Now, our focus is to study line signed graphs of Cayley signed graphs. In this paper, we have characterized the Cayley sets and generating sets for which line signed graphs of Cayley signed graphs are canonically consistent(C-consistent).
Tanuja Yadav, Amit Kumar
openaire   +1 more source

Line Graphs of Signed Graphs

2021
Signed graphs are another interesting variation of graphs, usually taken to be graphs in which each edge is either positive or negative. In the literature, there is more than one option for the rule for the labels on the edges of the line graph, and two of these will be considered here.
Lowell W. Beineke, Jay S. Bagga
openaire   +1 more source

Enumeration of graphs with signed points and lines

Journal of Graph Theory, 1977
AbstractOur object is to enumerate graphs in which the points or lines or both are assigned positive or negative signs. We also treat several associated problems for which these configurations are self‐dual with respect to sign change. We find that the solutions to all of these counting problems can be expressed as special cases of one general formula ...
Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk   +3 more
openaire   +2 more sources

QUOTIENTS OF COXETER GROUPS ASSOCIATED TO SIGNED LINE GRAPHS

Advances and Applications in Discrete Mathematics, 2020
Summary: In our previous paper [\textit{V. Bugaenko} et al., Discrete Appl. Math. 192, 17--27 (2015; Zbl 1319.05064)], we introduced the notion of weighted Coxeter graph and associated to it a certain generalization of the standard geometric representation of a Coxeter group. In the present paper, we continue to study this subject. When we put signs on
Cherniavsky, Yonah, Shwartz, Robert
openaire   +1 more source

Line signed graph of a signed unit graph of commutative rings

2022
Summary: In this paper we characterize the commutative rings with unity for which line signed graph of signed unit graph is balanced and consistent. To do this, first we derive some sufficient conditions for balance and consistency of signed unit graphs. The results have been demonstrated with ample number of examples.
openaire   +2 more sources

C-cordial labeling of line signed graphs-I

AIP Conference Proceedings, 2020
Let S=(G, σ) be a signed graph. S admits C-cordial labeling if the difference between the number of negative and positive edges (vertices) differ by at most one under canonical marking of S. In this paper, we characterize signed paths and cycles having given number of negative sections where the line signed graphs admit C-cordial labeling.
Divya Antoney, Tabitha Agnes Mangam, Mukti Acharya   +2 more
openaire   +1 more source

Signed graph based approach for on-line optimization in cognitive networks

2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011), 2011
One of the major architectural components shared between cognitive radios and networks is a cognitive engine supporting a cognitive process. Many of the decision making will need an optimization core for determining the optimum assignment for the control variables.
P. Balamuralidhar, Rajan Mindigal Alasingara Bhattachar   +1 more
openaire   +1 more source

Canonical Consistency of Semi-Total Line Signed Graphs

National Academy Science Letters, 2015
A signed graph (or sigraph in short) is an ordered pair \(S = (S^u, \sigma )\), where \(S^u\) is a graph \(G = (V, E)\) and \(\sigma :E\rightarrow \{+,-\}\) is a function from the edge set \(E\) of \(S^u\) into the set \(\{+, -\}\). The canonical marking on \(S\) is defined as: for each vertex \(v \in V(S)\), \(\displaystyle \mu _\sigma (v) = \prod _ ...
Deepa Sinha, Pravin Garg
openaire   +1 more source