Results 121 to 130 of about 828 (207)

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

Heliyon, 2023
D L, S DY.
europepmc   +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

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

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

An Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graph

, 2012
We derive an upper bound on the largest signless Laplacian eigen­value of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained re­moving the edges of the unique cycle in the ...
Rojo, Oscar, Collao, Macarena, Pizarro, Pamela   +2 more
core   +1 more source

Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

, 1976
In this paper we determine necessary and sufficient conditions for the square of a vertex-unicyclic graph to be Hamiltonian. The conditions are simple and easily checked.
Arthur M. Hobbs, Herbert Fleischner
core   +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

Reconstructing edge-deleted unicyclic graphs

CoRR
The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, Müller verified the conjecture for graphs with $n$ vertices and $n \log_2(n)$ edges, improving on Lovás's bound of $\log(n^2-n)/4$.
Anthony E. Pizzimenti, Umarkhon Rakhimov
openaire   +2 more sources

γ-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

On Sombor index and graph energy of some chemically important graphs

Examples and Counterexamples
Sombor index of a graph G=(V(G),E(G)) is provided by the expression ∑uv∈E(G)du2+dv2, where dx is the degree of the vertex x∈V(G). The energy of a graph is the quantity given by the total of the absolute values of its adjacency matrix’s eigenvalues.
Md Selim Reja, Sk. Md. Abu Nayeem
doaj   +1 more source