Results 1 to 10 of about 741,389 (216)
Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
Harishchandra S. Ramane +2 more
doaj +1 more source
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
On the r-dynamic coloring of some fan graph families
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
Total fuzzy graph coloring [PDF]
Journal of Hyperstructures, 2023 In this paper, a hybrid genetic algorithm (HGA) is proposed for the total fuzzy graph coloring (TFGC) problem. TFGC comprises of a graph with fuzzy vertices and edges, seeks to obtain an optimal $k-$coloring of that fuzzy graph such that the degree of ...
Smriti Saxena +2 more
doaj +1 more source
Total mixed domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi +2 more
doaj +1 more source
On two energy-like invariants of line graphs and related graph operations
Journal of Inequalities and Applications, 2016 For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues.
Xiaodan Chen, Yaoping Hou, Jingjian Li
doaj +1 more source
On the Total Set Chromatic Number of Graphs
Theory and Applications of Graphs, 2022 Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets.
Mark Anthony C. Tolentino +2 more
doaj +1 more source
Graphs whose line graphs are ring graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in ...
Mahdi Reza Khorsandi
doaj +1 more source
Wiener index of graphs over rings: a survey
AKCE International Journal of Graphs and Combinatorics, 2022 This article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs.
T. Asir +3 more
doaj +1 more source
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source