Results 231 to 240 of about 5,052,226 (252)
Some of the next articles are maybe not open access.
C-cordial labeling of line signed graphs-I
AIP Conference Proceedings, 2020Let 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 +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), 2011One 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 +1 more
openaire +1 more source
Canonical Consistency of Semi-Total Line Signed Graphs
National Academy Science Letters, 2015A 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
Graphs Comb., 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Signed graphs whose spectrum is bounded by
Applied Mathematics and Computation, 2022Zoran Stanić, Peter Rowlinson
exaly
Spectra of signed graphs with two eigenvalues
Applied Mathematics and Computation, 2020Zoran Stanić
exaly
Signed line graphs with least eigenvalue : The star complement technique
Discrete Applied Mathematics, 2016Francesco Belardo +2 more
exaly
Improving Link Sign Prediction in Signed Bipartite Graphs via Balanced Line Graphs
Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information RetrievalHongxiang Lin +3 more
openaire +2 more sources

