Results 151 to 160 of about 305 (179)

On broadcasting in unicyclic graphs

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

On the multiplicity of Laplacian eigenvalues for unicyclic graphs

Czechoslovak Mathematical Journal, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wen, Fei, Huang, Qiongxiang
openaire   +1 more source

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

Unicyclic Graphs with Minimal Energy

Journal of Mathematical Chemistry, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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

Trees and Unicyclic Graphs

The Mathematics Teacher, 1967
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire   +1 more source

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 the minimal matching energies of unicyclic graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianming Zhu, Ju Yang
openaire   +1 more source

Rumor source detection in unicyclic graphs

2017 IEEE Information Theory Workshop (ITW), 2017
Detecting information source in viral spreading has important applications such as to root out the culprit of a rumor spreading in online social networks. In particular, given a snapshot observation of the network topology of nodes having the rumor, how to accurately identify the initial source of the spreading? In the seminal work [Shah et el.
Pei-Duo Yu, Chee-Wei Tan 0001, Hung-Lin Fu   +2 more
openaire   +1 more source

Cycles and Unicyclic Components in Random Graphs

Combinatorics, Probability and Computing, 2003
Let \(G(n,m)\) denote a graph selected uniformly and at random from all graphs on \(n\) labelled vertices with \(m=m(n)\) edges. We say \(G(n,m)\) has a property \(\wp\) whp if \[ \lim_{n\rightarrow\infty}P\{G(n,m)\text{ has }\wp\}=1. \] Throughout the article under review, \(m=n/2\pm s\) where \(n^{2/3}=o(s)\) and \(s=o(n)\).
openaire   +2 more sources