Results 111 to 120 of about 580,793 (206)

On the Laplacian index of tadpole graphs

Special Matrices
In this article, we study the Laplacian index of tadpole graphs, which are unicyclic graphs formed by adding an edge between a cycle Ck{C}_{k} and a path Pn{P}_{n}.
Braga Rodrigo O., Veloso Bruno S.
doaj   +1 more source

Planar packing of cycles and unicyclic graphs

Demonstratio Mathematica, 2009
AbstractWe say that a graphIn this paper we show that for any packable ...
openaire   +1 more source

A structural approach to the graceful coloring of a subclass of trees. [PDF]

Heliyon, 2023
D L, S DY.
europepmc   +1 more source

Study of Some Interesting Topics in the Theory of Graphs [PDF]

, 2010
Not ...
Dani, Nilish A.
core  

Graphs which have pancyclic complements

International Journal of Mathematics and Mathematical Sciences, 1978
Let p and q denote the number of vertices and edges of a graph G, respectively. Let Δ(G) denote the maximum degree of G, and G¯ the complement of G. A graph G of order p is said to be pancyclic if G contains a cycle of each length n, 3≤n≤p.
H. Joseph Straight
doaj   +1 more source

Further development of F-index for fuzzy graph and its application in Indian railway crime. [PDF]

J Appl Math Comput, 2023
Islam SR, Pal M.
europepmc   +1 more source

Degree distance of unicyclic graphs

, 2010
The degree distance of a connected graph G with vertex set V(G) is defined as D'(G)= ?u?V (G) dG (u)DG (u), where dG (u) denotes the degree of vertex u and DG (u) denotes the sum of distances between u and all vertices of G.
Bo Zhou, Zhibin Du
core   +1 more source

The partition dimension of the vertex amalgamation of some cycles. [PDF]

Heliyon, 2022
Hasmawati, Hinding N, Nurwahyu B, Syukur Daming A, Kamal Amir A.   +4 more
europepmc   +1 more source

Conjugated tricyclic graphs with maximum variable sum exdeg index. [PDF]

Heliyon, 2023
Rizwan M, Bhatti AA, Javaid M, Shang Y.
europepmc   +1 more source

γ-Inverse graph of some mixed graphs

Special Matrices
Let GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa, Ghanem Manal, Abudayah Mohammad   +2 more
doaj   +1 more source