Results 41 to 50 of about 916,150 (184)
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
Sparse Graphs With Local Covering Conditions on Edges
Journal of Graph Theory, EarlyView.ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti +3 more
wiley +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
We prove a sharp forbidden interval for the nontrivial adjacency eigenvalues of trivially perfect graphs. More precisely, we show that if $G$ is a trivially perfect graph, then $\operatorname{Spec}(G)\cap [\sqrt{8}-4,0]\subseteq \{-1,0\}$. Moreover, we prove that the interval is best possible at both endpoints: there are connected trivially perfect ...
Conde, Cristian M. +2 more
openaire +2 more sources
From Finding a Spanning Subgraph H $H$ to an H $H$‐Factor
Journal of Graph Theory, EarlyView.ABSTRACT A typical Dirac‐type problem in extremal graph theory is to determine the minimum degree threshold for a graph G $G$ to have a spanning subgraph H $H$, for example, the Dirac theorem. A natural follow‐up problem is to seek an H $H$‐factor, which is a spanning set of vertex‐disjoint copies of H $H$.
Allan Lo
wiley +1 more source
Disrupting the Chain of Displaced Aggression: A Review and Agenda for Future Research
Journal of Organizational Behavior, EarlyView.ABSTRACT Displaced aggression refers to instances in which a person redirects their harm‐doing behavior from a primary to a secondary, substitute target. Since the publication of the first empirical article in 1948, there has been a noticeable surge in research referencing this theory in both management and psychology journals.
Constantin Lagios +4 more
wiley +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
Networks, EarlyView.ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs +2 more
wiley +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source