Results 161 to 170 of about 2,717 (193)

Trees and unicyclic graphs with hamiltonian path graphs

Journal of Graph Theory, 1990
AbstractWe prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.
openaire   +1 more source

On broadcasting in unicyclic graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harutyunyan, Hovhannes A., Maraachlian, Edward   +1 more
openaire   +1 more source

Extreme Sombor Spectral Radius of Unicyclic Graphs

Match Communications in Mathematical and in Computer Chemistry, 2023
Summary: Let \(G\) be a graph, the Sombor matrix \(S(G)\) of \(G\) was recently introduced by \textit{Z. Wang} et al. [``Spectral radius and energy of Sombor matrix of graphs'', Filomat 35, No. 15, 5093--5100 (2021; \url{doi:10.2298/FIL2115093W}]. It is a new matrix based on Sombor index, where the \((i,j)\) entry \(S_{ij}=\sqrt{d_i^2+d_j^2}\) if ...
Mei, Yinzhen, Fu, Huifeng, Miao, Hongli, Gao, Yubin   +3 more
openaire   +2 more sources

THE GUTMAN INDEX OF UNICYCLIC GRAPHS

Discrete Mathematics, Algorithms and Applications, 2012
Let G be a connected graph with vertex set V(G). The Gutman index of G is defined as S(G) = ∑{u, v}⊆V(G) d(u)d(v)d(u, v), where d(u) is the degree of vertex u, and d(u, v) denotes the distance between u and v. In this paper, we characterize n-vertex unicyclic graphs with girth k, having minimal Gutman index.
openaire   +2 more sources

Roman domination in unicyclic graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2012
Abstract A Roman dominating function on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f (v) = 2. The weight of a Roman dominating function is the value w (f) = ∑ u∈V f(u).
P. Roushini Leely Pushpam, T. N. M. Malini Mai   +1 more
openaire   +1 more source

EXTREMAL IRREGULARITY OF TOTALLY SEGREGATED UNICYCLIC GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2019
Summary: The irregularity of a simple graph \(G=(V,E)\) is defined as \(irr(G)=\sum_{uv\in E(G)}|\mathrm{deg}_G(v)|\), where \(\mathrm{deg}_G(u)\) denotes the degree of a vertex \(u\in V(G)\). A graph in which any two adjacent vertices have distinct degrees is a totally segregated graph. In this paper we determine maximum and minimum of \(\{irr(G): \ G
Jorry, T. F., Parvathy, K. S.
openaire   +2 more sources

Degree Condition for Subdivisions of Unicyclic Graphs

Graphs and Combinatorics, 2008
The authors prove the following results: Let \(H\) be any graph of order \(n\) with \(k\) vertex disjoint pieces \(H_1,\dots, H_k\), each of which contains at most one cycle. Let \(G\) be any graph of order at least \(n\) with \(\delta (G) \geq n -k \). Then \(G\) contains a cyclic subdivision of \(H\).
BABU, C, DIWAN, A
openaire   +3 more sources

REDUCED SECOND ZAGREB INDEX OF UNICYCLIC GRAPHS

Advances and Applications in Discrete Mathematics, 2018
Summary: Recently a novel degree based topological index, reduced second Zagreb index, defined for any connected graph as follows: \[RM_2=\sum_{uv\in E(G)}\,(d_u-1)(d_v-1), \] where \(d_u\) and \(d_v\) are the number of edges incident to the vertices \(u\) and \(v\), respectively.
openaire   +4 more sources

Unicycle graphs with extremal Merrifield–Simmons Index

Journal of Mathematical Chemistry, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Hongzhuan, Hua, Hongbo
openaire   +2 more sources

Largest eigenvalue of a unicyclic mixed graph

Applied Mathematics-A Journal of Chinese Universities, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources