291 citations · 336 across the 16 of their papers we have counts for
5 papers · 1 filter
New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic
Jia Huang, Jian Shen
The bondage number of a graph is the smallest number of edges whose removal from results in a graph with larger domination number. Let be embeddable on a surface…
Acyclic Subgraphs in -Majority Tournaments
Alexandra Ilic, Lilly Shen, Bobby Shen +1
A -majority digraph is a directed graph created by combining individual rankings on the same ground set to form a consensus where edges point in the direction indicated by a…
On the Spectrum of Middle-Cubes
Ke Qiu, Rong Qiu, Yong Jiang +1
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conj…
A bound on the scrambling index of a primitive matrix using Boolean rank
Mahmud Akelbek, Sandra Fital, Jian Shen
The scrambling index of an primitive matrix is the smallest positive integer such that , where denotes the transpose of and denote…
On the Chudnovsky-Seymour-Sullivan Conjecture on Cycles in Triangle-free Digraphs
Kevin Chen, Sean Karson, Dan Liu +1
For a simple digraph without directed triangles or digons, let be the size of the smallest subset such that has no directed cycles, and…