Results 51 to 60 of about 3,632 (158)
, 2015 The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite for every ...
Guillot, Dominique +2 more
core +1 more source
Nodes, Edges, and Artistic Wedges: A Survey on Network Visualization in Art History
Computer Graphics Forum, Volume 44, Issue 3, June 2025.Abstract Art history traditionally relies on qualitative methods. However, the increasing availability of digitized archives has opened new possibilities for research by integrating visual analytics. This survey presents a comprehensive review of the intersection between art history and visual analytics, focusing on network visualization and how it ...
Michaela Tuscher +4 more
wiley +1 more source
Networks, Volume 85, Issue 3, Page 326-347, April 2025.ABSTRACT Given an undirected graph G$$ G $$ whose edge weights change over s$$ s $$ time slots, the sub‐tree scheduling for wireless sensor networks with partial coverage asks to partition the vertices of G$$ G $$ in s$$ s $$ non‐empty trees such that the total weight of the trees is minimized.
Michele Barbato, Nicola Bianchessi
wiley +1 more source
On the Enumeration of Minimal Dominating Sets and Related Notions
, 2014 A dominating set $D$ in a graph is a subset of its vertex set such that each vertex is either in $D$ or has a neighbour in $D$. In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs, called the Dom-Enum
Kanté, Mamadou Moustapha +3 more
core +3 more sources
Strong bounds and exact solutions to the minimum broadcast time problem
International Transactions in Operational Research, Volume 32, Issue 1, Page 314-352, January 2025.Abstract Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their
Marika Ivanova +2 more
wiley +1 more source
Perfect Roman Domination: Aspects of Enumeration and Parameterization
AlgorithmsPerfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions.
Kevin Mann, Henning Fernau
doaj +1 more source
The Lovász–Cherkassky theorem in infinite graphs
Transactions of the London Mathematical Society, Volume 11, Issue 1, December 2024.Abstract Infinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdős–Menger conjecture (now known as the Aharoni–Berger theorem) that extends Menger's theorem to infinite graphs in a structural way. We prove a generalization of this manner of the classical result about packing edge‐disjoint T$ T$‐paths ...
Attila Joó
wiley +1 more source
Embedability between right-angled Artin groups
, 2011 In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of $\gam$. We produce a
Farb +3 more
core +2 more sources
P_3-Games on Chordal Bipartite Graphs
, 2016 Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest convex set that contains W subseteq V. Two players play the following game. Consider a convex set U and call it the `playground.' Initially, U = emptyset.
Hon, Wing-Kai +5 more
openaire +2 more sources
Tubings, chord diagrams, and Dyson–Schwinger equations
Journal of the London Mathematical Society, Volume 110, Issue 5, November 2024.Abstract We give series solutions to single insertion place propagator‐type systems of Dyson–Schwinger equations using binary tubings of rooted trees. These solutions are combinatorially transparent in the sense that each tubing has a straightforward contribution.
Paul‐Hermann Balduf +5 more
wiley +1 more source