相关论文: Maximally connected and super arc-connected Bi-Cay…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
A graph is non-trivial if it contains at least one nonloop edge. The essential connectivity of $G$, denoted by $\kappa'(G)$, is the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two components…
A digraph $D$ is $k$-linked if for every $2k$ distinct vertices $ x_1,\ldots , x_k, y_1, \ldots , y_k$ in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$ for each $i\in…
Azuma et al. showed that a strongly connected digraph without a doubly bidirectionally connected pair is cactus-expandable. We prove the converse: if a digraph has a doubly bidirectionally connected pair, then no expansion of it is cactus.
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…
A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
Every 4-connected graph with minimum degree $\delta$ and connectivity $\kappa$ either has a cycle of length at least $4\delta-2\kappa$ or has a dominating cycle.
A drawing of a graph in the plane is a thrackle if every pair of edges intersects exactly once, either at a common vertex or at a proper crossing. Conway's conjecture states that a thrackle has at most as many edges as vertices. In this…
A graph is strongly $\Z_{\ell}$-connected if for each boundary function $\beta: V(G)\mapsto \Z_{\ell}$ with $\beta(v) \equiv d(v) \pmod{2}$ for every vertex $v$ and $\sum_{v \in V(G)} \beta(v) \equiv 0 \pmod{2\ell}$, there exists an…
Given a graph $G=(V, E)$, a connected cut $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are connected. Given a positive…
Let \( D \) be a strongly connected digraph. The average distance of a vertex \( v \) in \( D \) is defined as the arithmetic mean of the distances from \( v \) to all other vertices in \( D \). The remoteness \( \rho(D) \) of \( D \) is…
An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\subseteq$ V that maximizes the number of edges in the cut \delta(S) such that the induced graph…
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
We prove that: I. If $L$ is a $T_1$ space, $|L|>1$ and $d(L) \leq \kappa \geq \omega$, then there is a submaximal dense subspace $X$ of $L^{2^\kappa}$ such that $|X|=\Delta(X)=\kappa$; II. If $\frak{c}\leq\kappa=\kappa^\omega<\lambda$ and…
A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It is known that every well-edge-dominated graph $G$ is also equimatchable, meaning that every maximal matching in $G$ is maximum. In this paper,…
In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…
Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph $\Ga(X)$ and the prime vertex graph $\Delta(X)$, for a set $X$ of positive integers, we define the bipartite divisor graph $B(X)$, and…
Assume that $\mathcal{P}$ is a topological property of a space $X$, then we say that $X$ is {\it dense-$\mathcal{P}$} if each dense subset of $X$ has the property $\mathcal{P}$. In this paper, we mainly discuss dense subsets of a space $X$,…
We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata and clarify their relation to endpoints of clique trees.…