Browse

Most recent

🧐 Most recent articles

Filter

20 results

Ebrahim Vatandoost, Masoumeh Khalili

Let G be a non-abelian group. The non-commuting graph of group G, shown by ΓG, is a graph with the vertex set G \ Z(G), where Z(G) is the center of group G. Also two distinct vertices of a and b are a...

Sarah-Marie Belcastro

We correct a small error in a 1996 paper of Albertson and Haas, and extend their lower bound for the fraction of properly colorable edges of planar subcubic graphs that are simple, connected, bridgele...

Ju Zhou

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). I...

Martin Baca, Muhammad Irfan, Aisha Javed, Andrea Semanicova-Fenovcikova

For a simple graph G = (V, E) this paper deals with the existence of an edge labeling φ : E(G) → {0, 1, …, k − 1}, 2 ≤ k ≤ ∣E(G)∣, which induces a vertex labeling φ * : V(G) → {0, 1, …, k − 1} in suc...

Diamantis Koreas

V.G. Vizing showed that any graph belongs to one of two classes: Class 1 if χʹ(G) = Δ(G) or in class 2 if χʹ(G) = Δ(G) + 1, where χʹ(G) and Δ(G) denote the edge chromatic index of G and the maximum de...

S. Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak

In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will...

Hafizh M. Radiapradana, Suhadi Wido Saputro, Erma Suwastika, Oki Neswan, Andrea Semanicova-Fenovcıkova

For integer k ≥ 2, let X = {0, 1, 2, …, k}. In this paper, we determine the order of a star graph K1, n of n + 1 vertices, such that K1, n admits a topological integer additive set-labeling (TIASL) wi...

Chithra Mr, Manju K. Menon, A. Vijayakumar

Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good interconnection network topologies. In any network topology, the vertices represent the processors and...

Leomarich F. Casinillo

Let G = (V(G), E(G)) be a path of order n ≥ 1. Let fm(G) be a path with m ≥ 0 independent dominating vertices which follows a Fibonacci string of binary numbers where 1 is the dominating vertex. A set...

Dalibor Froncek, Aaron Shepanik

A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, …, n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighb...

Christina Eubanks-Turner, Aihua Li

In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdös, Rényi and Sos. Explicit formulas, special values and behavio...

Abdollah Alhevaz, Maryam Baghipur, Ebrahim Hashemi

The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is th...

Salman Ghazal

We find the structure of graphs that have no C4, $\overline{C}_4$, C5, S3, chair and co-chair as induced subgraphs. Then we deduce the structure of the graphs having no induced C4, $\overline{C_4}$, S...

Cristina Dalfo, Miquel Àngel Fiol

A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships betw...

Fendy Septyanto, Kiki A. Sugeng

Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors. The map γ is called a rainbow colorin...

Suresh Elumalai, Toufik Mansour, Mohammad Ali Rostami

The hyper-Zagreb index of a simple connected graph G is defined by ${\chi ^2}(G) = \sum_{uv \in E(G)} {{{\left( {d(u) + d(v)} \right)}^2}}$. In this paper, we establish, analyze and compare some new u...

Vladimir Dimitrov Samodivkin

The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the ineq...

Luis R. Fuentes, Italo J. Dejter, Carlos A. Araujo

Let $0<n\in\mathbb{Z}$. In the unit distance graph of $\mathbb{Z}^n\subset\mathbb{R}^n$, a perfect dominating set is understood as having induced components not necessarily trivial. A modification ...

Sudip Bera

Given a group G, the intersection power graph of G, denoted by $\mathcal{G}_I(G)$, is the graph with vertex set G and two distinct vertices x and y are adjacent in $\mathcal{G}_I(G)$ if there exists ...

Somayeh Jahari, Saeid Alikhani

Let G be a simple graph of order n. The domination polynomial of G is the polynomial $D(G, x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where d(G,i) is the number of dominating sets of G of size i and $\g...