The strongly chordal graph literature has recently expanded to include the sequentially smaller classes of \(s\)-strongly chordal graphs for \(s = 1, 2, 3,\ldots\) (and the limiting class of majorly chordal graphs). These stronger classes preserve — while simultaneously intensifying —  the conventional chords-of-cycles inspiration of chordal graph theory. This leads to characterizing corresponding \(s\)-strongly chordal bipartite graphs and majorly chordal bipartite graphs. Our new analysis does this by using chains of quadrangles, with each adjacent pair of quadrangles having a unique edge in common. This leads to constructive characterizations that exploit a somewhat unexpected resemblance to earlier characterizations of \(s\)-strongly chordal graphs involving chains of triangles sharing common edges to characterize \(s\)-strongly chordal tripartite (and, similarly, multipartite) graphs.

In this paper, we present a method for constructing a new sequence, which we call \(k-\)division sequence and denoted by \(h_n(k)\). Using Fibonacci and Pell sequences, we define the \(k-\)division Fibonacci-Pell sequence obtain its properties, and prove that this sequence is periodic. Then, as an application of the sequence, we define \(1-\)division Fibonacci-Pell sequence on finite groups and study it in the groups \(G_m\) and \(H_{(u,l,m)}\) groups.

We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization problem, which is different from the classic minimum weight dominating set problem that requires finding a dominating set of the smallest weight in a graph without trying to optimize its cardinality. In other words, the objective of minimizing the size of the dominating set in the two-objective problem can be considered as a constraint, i.e. a particular case of finding Pareto-optimal solutions. First, we show how to reduce the two-objective optimization problem to the minimum weight dominating set problem by using Integer Linear Programming formulations. Then, under different assumptions, the probabilistic method is applied to obtain upper bounds on the minimum weight dominating sets in graphs. The corresponding randomized algorithms for finding small-weight dominating sets in graphs are described as well. Computational experiments are used to illustrate the results for two different types of random graphs.

Let \(G\) be a plane graph. If two edges are adjacent and consecutive on the boundary walk of a face of \(G\), then they are said to be facially adjacent. We call \(G\) facially entire \(k\)-colorable if there is a mapping from \(V(G)\cup E(G)\cup F(G)\) to a \(k\) color set so that any two facially adjacent edges, adjacent vertices, adjacent faces, and incident elements receive different colors. The facial entire chromatic number of \(G\) is defined to be the smallest integer \(k\) such that \(G\) is facially entire \(k\)-colorable. In 2016, Fabrici, Jendrol’ and Vrbjarová conjectured that every connected, loopless, bridgeless plane graph is facially entire \(7\)-colorable. In this paper, we give a positive answer to this conjecture for \(K_4\)-minor-free graphs. More specifically, we shall prove that every \(K_{4}\)-minor-free graph is facially entire \(7\)-colorable.

The Markov graph of a self-map on a combinatorial tree is a directed graph that encodes the covering relations between edges of the tree under the map. This work explores the dynamical structure of self-maps on trees with weakly connected Markov graphs. The main result of the paper is a complete characterization of self-maps on finite sets that yield weakly connected Markov graphs for all trees. Additionally, we describe the dynamical structure of self-maps whose Markov graphs take specific forms, including complete digraphs, cycles, paths, in-stars, and out-stars.

In this paper, we construct two infinite families of graphs \(G(d,c)\) and \(G^+(d,c)\), where, in both cases, a vertex label is \(x_1x_2\ldots x_c\) with \(x_i\in\{1,2,\ldots, d\}\). We provide a tight lower bound on the metric dimension of \(G^+(d, c)\). Moreover, we give the definition and properties of the supertoken graphs, a generalization of the well-known token graphs. Finally, we provide an upper bound on the metric dimension of supertoken graphs.

Let \(A\) be a commutative ring with nonzero identity and \(n\geq 2\) be a positive integer. With the ring \(R=A\times\cdots\times A\) (\(n\) times), one can associate graphs \(TD(R)\) and \(ZD(R)\) respectively called the total dot product graph and the zero-divisor dot product graph of \(R\). In this paper, we study some topological properties of these two dot product graphs of \(R.\) In particular, it is shown that, the zero-divisor dot product graph \(ZD(R)\) is a projective graph if and only if \(R\) is isomorphic to \(\frac{Z_2\left[x\right]}{\left\langle x^2+x+1\right\rangle}\times\frac{Z_2\left[x\right]}{\left\langle x^2+x+1\right\rangle}.\) Moreover, we prove that no total dot product graph can be projective. With these observations, we classify all commutative rings for which dot product graphs \(ZD(R)\) and \(TD(R)\) have crosscap two.