Results 31 to 40 of about 252,834 (270)
A bivariate chromatic polynomial for signed graphs [PDF]
, 2014 We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$.
Beck, Matthias, Hardin, Mela
core +1 more source
Walks and eigenvalues of signed graphs
Special Matrices, 2023 In this article, we consider the relationships between walks in a signed graph G˙\dot{G} and its eigenvalues, with a particular focus on the largest absolute value of its eigenvalues ρ(G˙)\rho \left(\dot{G}), known as the spectral radius.
Stanić Zoran
doaj +1 more source
Signed Graph Convolutional Networks
2018 IEEE International Conference on Data Mining (ICDM), 2018 Due to the fact much of today's data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. One recent direction that has shown fruitful results, and therefore growing interest, is the usage of graph convolutional neural networks (GCNs). They have been shown to provide a significant improvement on a
Derr, Tyler, Ma, Yao, Tang, Jiliang
openaire +2 more sources
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]
Transactions on Combinatorics, 2016 A emph{signed graph} (or, in short, emph{sigraph}) $S=(S^u,sigma)$ consists of an underlying graph $S^u :=G=(V,E)$ and a function $sigma:E(S^u)longrightarrow {+,-}$, called the signature of $S$. A emph{marking} of $S$ is a function $mu:V(S)longrightarrow
Mukti Acharya +2 more
doaj
Model Counting for Formulas of Bounded Clique-Width [PDF]
, 2013 We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width).
B. Courcelle +13 more
core +2 more sources
Negation switching invariant signed graphs
Electronic Journal of Graph Theory and Applications, 2014 A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigraph obtained from S by reversing the sign of every ...
Deepa Sinha, Ayushi Dhama
doaj +1 more source
Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
Complexity, 2020 A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems.
Yajing Wang, Yubin Gao
doaj +1 more source
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
Algorithms, 2021 This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj +1 more source
The H-Line Signed Graph Of A Signed Graph
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required. We treat only finite simple graphs without self loops and isolates.
Rangarajan, R. +2 more
openaire +2 more sources
List homomorphism problems for signed graphs
, 2021 We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of ...
Bok, Jan +4 more
core