Search

Your search keyword '"middle graph"' showing total 3 results
Start Over Descriptor "middle graph" Publisher sciendo
3 results on '"middle graph"'

1. On the r-dynamic coloring of some fan graph families

Author

Falcón Raúl M., Venkatachalam M., Gowri S., and Nandini G.

Subjects
r-dynamic coloring, fan graph, middle graph, total graph, central graph, line graph, primary 05c15, Mathematics, QA1-939
Abstract

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 line graph L(Fm,n). In addition, we determine the r-dynamic chromatic number of each one of these four families of graphs in case of being m = 1.

Published
2021
Full Text
View/download PDF

2. A Note on Total Graphs

Author

B.H. Vaqari Motlagh, R. Pandiya Raj, S.F. Forouhandeh, H. P. Patil, and N. Jafari Rad

Subjects
Block graph, Discrete mathematics, Applied Mathematics, Symmetric graph, Comparability graph, mycielski graph, total graph, central graph, law.invention, Combinatorics, Pathwidth, middle graph, law, Outerplanar graph, Triangle-free graph, Line graph, QA1-939, Discrete Mathematics and Combinatorics, Mathematics, Universal graph, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.

Published
2015

3. On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers

Author

R. Pandiya Raj and H.P. Patil

Subjects
Symmetric graph, mycielski graph, achromatic number, central graph, law.invention, Combinatorics, covering number, law, chromatic number, Outerplanar graph, Line graph, QA1-939, Discrete Mathematics and Combinatorics, independence number, Graph property, Mathematics, Discrete mathematics, Applied Mathematics, Voltage graph, total graph, edge covering number, edge independence number, middle graph, Triangle-free graph, Cubic graph, Null graph
Abstract

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. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated.

Published
2013

Catalog

Books, media, physical & digital resources
See catalog results