Projective-planar signed graphs and tangled signed graphs
Copyright policy )Projective-planar signed graphs and tangled signed graphs
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 and then taking 1-, 2-, and 3-sums with balanced signed graphs.
- University System of Ohio United States
- Wright State University United States
Statistics and Probability, Projective plane, Applied Statistics, Applied Mathematics, Theoretical Computer Science, Computational Theory and Mathematics, Physical Sciences and Mathematics, Discrete Mathematics and Combinatorics, Signed graph, Mathematics, Regular matroid
Statistics and Probability, Projective plane, Applied Statistics, Applied Mathematics, Theoretical Computer Science, Computational Theory and Mathematics, Physical Sciences and Mathematics, Discrete Mathematics and Combinatorics, Signed graph, Mathematics, Regular matroid
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).18 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!