Results 91 to 100 of about 2,717 (193)

A STUDY ON UNICYCLIC GRAPH

open access: yes, 2020
{"references": ["1.\tJ. Amalorpava Jerline, L. Benedict Michaelraj, On a conjecture of harmonic index and diameter of graphs, Kragujevac Journal of Mathematics, 40(1), (2016),73-78. 2.\tR. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer-Verlog, New York, 2000. 3.\tH. Deng, S. Balachandran, S. K. Ayyaswamy, Y. B.
I. Ignomary, S. Suganya
openaire   +1 more source

Isolate Domination in Unicyclic Graphs

open access: yesInternational Journal of Mathematics and Soft Computing, 2013
A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called a dominating set of $G$ if every vertex in $V-D$ is adjacent to a vertex in $D$. A dominating set $D$ such that $$ has an isolated vertex is called an isolate dominating set and the minimum cardinality of an isolate dominating set is called the isolate domination number of $G$ and is ...
S. Balamurugan, I. Sahul Hamid
openaire   +1 more source

Solutions of Detour Distance Graph Equations. [PDF]

open access: yesSensors (Basel), 2022
Prabha SC   +7 more
europepmc   +1 more source

On the Laplacian index of tadpole graphs

open access: yesSpecial 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

Graphs which have pancyclic complements

open access: yesInternational 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]

open access: yesHeliyon, 2022
Hasmawati   +4 more
europepmc   +1 more source

γ-Inverse graph of some mixed graphs

open access: yesSpecial 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   +2 more
doaj   +1 more source

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

open access: yesHeliyon, 2023
Rizwan M, Bhatti AA, Javaid M, Shang Y.
europepmc   +1 more source

Home - About - Disclaimer - Privacy