Results 111 to 120 of about 891,390 (207)

Elliptic Sombor index of trees and unicyclic graphs

Electronic Journal of Mathematics
Let G = G ( V, E ) be a simple connected graph with vertex set V and edge set E . The elliptic Sombor index of G is defined as ESO ( G ) = (cid:80) uv ∈ E ( d ( u ) + d ( v )) (cid:112) d 2 ( u ) + d 2 ( v ) , where d ( u ) denotes the degree of vertex u .
Zikai Tang, Yunping Li, Hanyuan Deng
semanticscholar   +1 more source

Induced Geodetic Sequence of a Graph [PDF]

Transactions on Combinatorics
A vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$.
Liju Olickal, John Mulloor
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

Minimum atom-bond sum-connectivity index of unicyclic graphs with maximum degree

Discrete Mathematics Letters
Let G be a graph with edge set E ( G ) . Denote by d u the degree of a vertex u in G . The atom-bond sum-connectivity (ABS) index of G is defined as ABS ( G ) = (cid:80) xy ∈ E ( G ) (cid:112) ( d x + d y − 2) / ( d x + d y ) .
Palaniyappan Nithya, S. Elumalai, Selvaraj Balachandran   +2 more
semanticscholar   +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

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

Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices

The Electronic Journal of Linear Algebra
A signed graph $\Gamma=(G,\sigma)$ consists of an underlying graph $G=(V,E)$ with a sign function $\sigma:E\rightarrow\{1,-1\}$. Let $A(\Gamma)$ be the adjacency matrix of $\Gamma$. Let $\lambda_1(A(\Gamma))\geq\lambda_2(A(\Gamma))\geq\cdots\geq\lambda_n(
Minghui Yan, Dan Li, Yongang Wang, Jixiang Meng   +3 more
semanticscholar   +1 more source

Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]

Molecules, 2022
Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc   +1 more source

Reconstructing edge-deleted unicyclic graphs

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$.
Pizzimenti, Anthony E., Rakhimov, Umarkhon   +1 more
openaire   +2 more sources