Konu "Cycle" için listeleme
Toplam kayıt 8, listelenen: 1-8
-
Decomposition of tensor product of complete graphs into cycles and stars with four edges
(Işık University Press, 2023-04)In this paper, we prove that the necessary conditions are sufficient for the existence of a decomposition of tensor product of complete graphs into cycles and stars with four edges. -
Domination number of a bipartite semigraph when it is a cycle
(Işık University Press, 2022)Semigraph is a generalization of graph, with two or more vertices on edges which allows multiplicity in every concept of graph when it comes to semigraph. When number of vertices on the edges are restricted to two the ... -
Grundy coloring of middle graph of wheel graph families
(Işık University Press, 2023-07)A Grundy k-coloring of a graph G is a proper k-coloring of vertices in G using colors {1, 2, · · · , k} such that for any two colors i and j, i < j, any vertex colored j is adjacent to some vertex colored i. The First-Fit ... -
Harmonic Mean Cordial labeling of some graphs
(Işık University Press, 2024-01)All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) ? {1, 2} is called Harmonic Mean Cordial if the induced function f*: E(G) ? {1, ... -
On leap Zagreb indices of some cycle related graphs
(Işık University Press, 2022)Let G = (V, E) represent a graph. The 2-degree of a vertex v in G is the number of vertices which are at distance two from v and denoted by d₂(v). The leap Zagreb indices are the recently introduced distance-based topological ... -
On the spectra of cycles and paths
(Işık University Press, 2019)Energy of a graph was defined by E. Hückel as the sum of absolute values of the eigenvalues of the adjacency matrix during the search for a method to obtain approximate solutions of Schr¨odinger equation which include the ... -
Pair difference cordial labeling of some union of graphs
(Işık University Press, 2023-07)Let G = (V, E) be a (p, q) graph. Define ? = {p/2 if p is even p?1/2 if p is odd and L = {±1, ±2, ±3, · · · , ±?} called the set of labels. Consider a mapping f : V ? L by assigning different labels in L to the different ... -
Root cube mean cordial labeling of Cn ? Cm, for n, m ? N
(Işık University Press, 2024-04)All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) ? {0, 1, 2} is called root cube mean cordial labeling if the induced function f? ...