Results 171 to 180 of about 412,655 (203)

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   +4 more sources

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

Unicyclic Graphs with Minimal Energy

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

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

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

On the degree Kirchhoff index of unicyclic graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuli Qi, Bo Zhou 0007
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

Algorithms for optimal orientations of a unicyclic graph

Proceedings of the 42nd annual Southeast regional conference, 2004
Let (G, R) denote the directed graph obtained from undirected graph G by an acyclic orientation R so that (G, R) contains no directed cycle. We consider acyclic orientations R of a unicyclic graph G which maximizes/minimizes the number of ordered pairs of non-adjacent vertices with directed paths in (G, R).
Suk Jai Seo, Ashok T. Amin
openaire   +1 more source

Unicyclic graphs with regular endomorphism monoids

Discrete Mathematics, Algorithms and Applications, 2016
The motivation of this paper comes from an open question: which graphs have regular endomorphism monoids? In this paper, we give a definitely answer for unicyclic graphs, proving that a unicyclic graph [Formula: see text] is End-regular if and only if, either [Formula: see text] is an even cycle with 4, 6 or 8 vertices, or [Formula: see text] contains ...
Xiaobin Ma, Dein Wong, Jinming Zhou
openaire   +2 more sources

Dot product dimension of unicyclic graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahin Bahrami, Dariush Kiani, Asghar Bahmani   +2 more
openaire   +1 more source