نتایج جستجو برای: signed graph

تعداد نتایج: 211450  

2014
THOMAS ZASLAVSKY

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

Journal: :Discussiones Mathematicae Graph Theory 2015
Abdollah Khodkar Babak Samadi Lutz Volkmann

Let G be a graph. A function f : V (G) → {−1, 1} is a signed kindependence function if the sum of its function values over any closed neighborhood is at most k − 1, where k ≥ 2. The signed k-independence number of G is the maximum weight of a signed k-independence function of G. Similarly, the signed total k-independence number of G is the maximum weight of a signed total k-independence functio...

Journal: :Discrete Mathematics 2012
Thomas Zaslavsky

2010 Mathematics Subject Classifications: Primary 05C22; Secondary 05C15, 05C25, 05C30 Abstract. Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups, chromatic numbers, and numbers of proper 1-colorations, thereby illu...

Journal: :Electr. J. Comb. 2014
Benjamin Braun Sarah Crown Rundell

Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents.

Journal: :Journal of Graph Theory 2005
James F. Geelen Bert Gerards

The key to Seymour’s Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R10or R12-minor is graphic or cographic. We present a proof of this in terms of signed graphs. 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005

2016
CHRISTOPHER R. H. HANUSA

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

Journal: :Electr. J. Comb. 2011
Deepa Sinha Pravin Garg

A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (V,E) and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}. For a positive integer n > 1, the unitary Cayley graph Xn is the graph whose vertex set is Zn, the integers modulo n and if Un denotes set of all units of the ring Zn, then two vertices a, b are adjacent if and only if a...

2016
G. DAVID BAILEY DAVID BAILEY

In 1994, Edelman and Reiner characterized free and supersolvable hyperplane arrangements in the restricted interval [An−1, Bn]. In this paper, we give a characterization of inductively factored arrangements in this interval, and show that the same characterization also describes factored arrangements in this interval. These results use the compact notation of signed graphs introduced by Zaslavsky.

Journal: :Applied sciences 2023

Node embeddings are increasingly used in various analysis tasks of networks due to their excellent dimensional compression and feature representation capabilities. However, most researchers’ priorities have always been link prediction, which leads signed network clustering being under-explored. Therefore, we propose an asymmetric ladder-shaped architecture called RGCLN based on multi-relational...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید