Figure 2 - available via license: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Content may be subject to copyright.
Source publication
Given a digraph, an ordering of its vertices defines a \emph{backedge graph}, namely the undirected graph whose edges correspond to the arcs pointing backwards with respect to the order. The \emph{degreewidth} of a digraph is the minimum over all ordering of the maximum degree of the backedge graph. We answer an open question by Keeney and Lokshtan...
Context in source publication
Similar publications
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$, where each $uv\in E\left( G\right) $ is labeled $f\left( u\right) +f\left( v\right) $. The strength $\mathrm{str}\left( G\right) $ of $G$ is defined by $\mathrm{str}\left( G\right) =\min \left\...
For a vertex u in the dominating set D of a graph G, the number of edges from u to V-D is called the outdegree of u with respect to D, d°D, G(u). A dominating set D is called the outdegree equitable dominating set if the absolute value of the differences of outdegrees of any two vertices in D is at most one. The minimum cardinality of an outdegree...
The triple connected Roman domination number denoted by () is the minimum weight of a triple connected Roman dominating function = (0 , 1 , 2) on G. The complement of a graph G is graph ̅ , in which any two vertices are adjacent if and only if they are not adjacent in G. In this paper we compute triple connected Roman domination number for compleme...
Let 𝒢 be a linked and undirected graph. Every linked graph 𝒢 must contain a spanning tree 𝒯, which is a subgraph of 𝒢that is a tree and contain all the nodes of 𝒢. The number of spanning trees in graph 𝒢, also called the complexity of the graph 𝒢, represented by τ(𝒢), is the total number of distinct spanning trees of graph 𝒢. This research aims to...
![Fig. 1 The whole region 3,3 as described by Huang et al. [43]. The...](publication/383439357/figure/fig1/AS:11431281273847787@1724766234567/The-whole-region-3-3-as-described-by-Huang-et-al-43-The-lower-bound-is-c-3-3-x_Q320.jpg)
We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on the Ramsey multiplicity of $$K_4$$ K 4 and $$K_5$$ K 5 and settle the minimum number of independent sets of size 4 in graphs with clique number at most 4. Motivated by th...
