Results 1 to 10 of about 317 (167)
On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs Under Dynamic Evolution
The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction.
Yu Yang
exaly +3 more sources
Complexity of Some Duplicating Networks
There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
Incidence and Laplacian matrices of wheel graphs and their inverses
It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +1 more source
The spectral determination of the connected multicone graphs
The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle.
Ali Zeydi Abdian +4 more
doaj +1 more source
Modular Coloring and Switching in Some Planar Graphs
For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
doaj +1 more source
Super Edge Bimagic and Trimagic Total Labeling for some Graphs. [PDF]
A super edge trimagic total labeling (SETTL) of a graph Γ with α vertices and β edges is a bijection Φ:[V (Γ) ∪ E(Γ)] ⟶{1,2,3,· · · ,α+β} such that for each edge ϑω∈E(Γ), the value of the formula [ Φ(ϑ)+Φ(ω)+Φ(ϑω)] is either Κ_1 or Κ_2 or Κ_3, with the ...
Mohamed R. Zeen El Deen +3 more
doaj +1 more source
Detour Global Domination for Degree Splitting graphs of some graphs
In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined.
C. Jayasekaran, S.V. Ashwin Prakash
doaj +1 more source
Topological invariants for the line graphs of some classes of graphs
Graph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics.
Zhou Xiaoqing +5 more
doaj +1 more source

