Results 11 to 20 of about 732,396 (308)
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 Acquisition in Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2013 Let $G$ be a weighted graph in which each vertex initially has weight $1$. A total acquisition move transfers all the weight from a vertex $u$ to a neighboring vertex $v$, under the condition that before the move the weight on $v$ is at least as large as the weight on $u$.
Timothy D. LeSaulnier +4 more
openaire +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
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Discrete Mathematics, 1984 Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
D. V. S. Sastry, B. Syam Prasad Raju
openaire +2 more sources
Total Graphs and Traversability [PDF]
Proceedings of the Edinburgh Mathematical Society, 1966 With every graph G (finite and undirected with no loops or multiple lines) there is associated a graph L(G), called the line-graph of G, whose points correspond in a one-to-one manner with the lines of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of Gare adjacent. This concept was originated by Whitney (3).
Behzad, Mehdi, Chartrand, Gary
openaire +2 more sources
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source