Results 91 to 100 of about 63,637 (247)
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
Periodic Orbits of MAX and MIN Multistate Networks
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set 𝒞, which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary 𝒞‐maxterm (or 𝒞‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean
Juan A. Aledo +3 more
wiley +1 more source
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
A note on the minimum rank of graphs with given dominating induced subgraph
The American Journal of CombinatoricsAn induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj +1 more source
Hereditary Equality of Domination and Exponential Domination
Discussiones Mathematicae Graph Theory, 2018 We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
On The Number of Distinct Induced Subgraphs of a Graph
Discrete Mathematics, 1989 AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k⩾1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m⩽k+1.
Andras Hajnal, Paul Erdös
openaire +2 more sources
Precedence‐Constrained Shortest Path
Networks, EarlyView.ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing +2 more
wiley +1 more source
Heavy subgraph pairs for traceability of block-chains
Discussiones Mathematicae Graph Theory, 2014 A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type ...
Li Binlong +2 more
doaj +1 more source
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Transactions on Combinatorics, 2018 Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
Robust Densest Subgraph Discovery
, 2018 Dense subgraph discovery is an important primitive in graph mining, which has a wide variety of applications in diverse domains. In the densest subgraph problem, given an undirected graph $G=(V,E)$ with an edge-weight vector $w=(w_e)_{e\in E}$, we aim to
Miyauchi, Atsushi, Takeda, Akiko
core +1 more source