# Browse

## You are looking at 1 - 10 of 5,368 items for :

• Mathematics
Clear All  Open access

## Abstract

Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. The clique number ω(G) of a graph G is the maximum cardinality of a complete subgraph of G. In this paper, we show that a connected graph G with clique number ω(G) ≤ r is maximally edge-connected or super-edge-connected if the number of edges is large enough. These are generalizations of corresponding results for triangle-free graphs by Volkmann and Hong in 2017.

Open access

## Abstract

Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly two chords. In spite of its overly simplistic look, this can be regarded as a natural strengthening of unichordfree graphs—not just the next step in a sequence of strengthenings—and it has a variety of characterizations. For instance, a 2-connected graph is strongly unichord-free if and only if it is complete bipartite or complete or “minimally 2-connected” (defined as being 2-connected such that deleting arbitrary edges always leaves non-2-connected subgraphs).

Open access

## Abstract

Let T (XY, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex xXY, the second out-neighbourhood N ++(x) of x is the set of all vertices with distance 2 from x. In this paper, we prove that T contains at least two vertices x such that |N ++(x)| ≥ |N +(x)| unless T is in a special class ℬ1 of bipartite tournaments; show that T contains at least a vertex x such that |N ++(x)| ≥ |N (x)| and characterize the class ℬ2 of bipartite tournaments in which there exists exactly one vertex x with this property; and prove that if |X| = |Y | or |X| ≥ 4|Y |, then the bipartite tournament T contains a vertex x such that |N ++(x)|+|N +(x)| ≥ 2|N (x)|.

Open access

## Abstract

Let G = (V, E) be a connected graph with vertex set V (G) and edge set E(G). The product connectivity Banhatti index of a graph G is defined as, $PB(G)=∑ue1dG(u)dG(e)$ where ue means that the vertex u and edge e are incident in G. In this paper, we determine P B(G) of some standard classes of graphs. We also provide some relationship between P B(G) in terms of order, size, minimum / maximum degrees and minimal non-pendant vertex degree. In addition, we obtain some bounds on P B(G) in terms of Randić, Zagreb and other degree based topological indices of G.

Open access

## Abstract

Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection : V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑xN(v) (x) = k for all vV, where N(v) is the open neighborhood of v.

Tuttes flow conjectures are a major source of inspiration in graph theory. In this paper we ask when we can assign n distinct labels from the set {1, 2, . . ., n} to the vertices of a graph G of order n such that the sum of the labels on heads minus the sum of the labels on tails is constant modulo n for each vertex of G. Therefore we generalize the notion of distance magic labeling for oriented graphs.

Open access

## Abstract

A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex. The weight of a total Roman dominating function f is the value f(V (G)) = ΣuV(G)f (u). The total Roman domination number γtR(G) is the minimum weight of a total Roman dominating function of G. Ahangar et al. in [H.A. Ahangar, M.A. Henning, V. Samodivkin and I.G. Yero, Total Roman domination in graphs, Appl. Anal. Discrete Math. 10 (2016) 501–517] recently showed that for any graph G without isolated vertices, 2γ(G) ≤ γtR(G) ≤ 3γ(G), where γ(G) is the domination number of G, and they raised the problem of characterizing the graphs G achieving these upper and lower bounds. In this paper, we provide a constructive characterization of these trees.

Open access

## Abstract

Let G = (V, E) be a graph and let f : V (G) → {0, 1, 2} be a function. A vertex v is said to be protected with respect to f, if f(v) > 0 or f(v) = 0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function if (i) every vertex in V is protected, and (ii) each vV with positive weight has a neighbor uV with f(u) = 0 such that the function fuv : V → {0, 1, 2}, defined by fuv(u) = 1, fuv(v) = f(v) − 1 and fuv(x) = f(x) for xV \ {v, u}, has no unprotected vertex. The weight of f is ω(f) = ∑vV f(v). The co-Roman domination number of a graph G, denoted by γcr(G), is the minimum weight of a co-Roman dominating function on G. In this paper, we give a characterization of graphs of order n for which co-Roman domination number is $2n3$ or n − 2, which settles two open problem in [S. Arumugam, K. Ebadi and M. Manrique, Co-Roman domination in graphs, Proc. Indian Acad. Sci. Math. Sci. 125 (2015) 1–10]. Furthermore, we present some sharp bounds on the co-Roman domination number.

Open access

## Abstract

A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition 𝒫 of G is called b-domatic if no larger domatic partition of G can be obtained from 𝒫 by transferring some vertices of some classes of 𝒫 to form a new class. The minimum cardinality of a b-domatic partition of G is called the b-domatic number and is denoted by bd(G). In this paper, we explain some properties of b-domatic partitions, and we determine the b-domatic number of some families of graphs.

Open access

## Abstract

We prove that any harmonic partial cube is antipodal, which was conjectured by Fukuda and K. Handa, Antipodal graphs and oriented matroids, Discrete Math. 111 (1993) 245–256. Then we prove that a partial cube G is antipodal if and only if the subgraphs induced by Wab and Wba are isomorphic for every edge ab of G. This gives a positive answer to a question of Klavžar and Kovše, On even and harmonic-even partial cubes, Ars Combin. 93 (2009) 77–86. Finally we prove that the distance-balanced partial cube that are antipodal are those whose pre-hull number is at most 1.

Open access

## Abstract

In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been studied extensively following their introduction in 2004 and are the subject of a book published by Kitaev and Lozin in 2015. Recently there has been interest in studying graphs represented by pattern-avoiding words. In particular, in 2016, Gao, Kitaev, and Zhang investigated 132-representable graphs, that is, word-representable graphs that can be represented by a word which avoids the pattern 132. They proved that all 132-representable graphs are circle graphs and provided examples and properties of 132-representable graphs. They posed several questions, some of which we answer in this paper.

One of our main results is that not all circle graphs are 132-representable, thus proving that 132-representable graphs are a proper subset of circle graphs, a question that was left open in the paper by Gao et al. We show that 123-representable graphs are also a proper subset of circle graphs, and are different from 132-representable graphs. We also study graphs represented by pattern-avoiding 2-uniform words, that is, words in which every letter appears exactly twice.  