Cycles through two edges in signed graphs

arxiv(2023)

引用 0|浏览6
暂无评分
摘要
We give a characterization of when a signed graph $G$ with a pair of distinguished edges $e_1, e_2 \in E(G)$ has the property that all cycles containing both $e_1$ and $e_2$ have the same sign. This answers a question of Zaslavsky.
更多
查看译文
关键词
edges,graphs,cycles
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要