Results 61 to 70 of about 149 (111)

Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph

Discussiones Mathematicae Graph Theory, 2021
Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G− e, then for each (of the at most two) such vertex x, delete ...
Wu Jichang, Broersma Hajo, Mao Yaping, Ma Qin   +3 more
doaj   +1 more source

COMPUTING SOME DISTANCE – BASED TOPOLOGICAL INDICES OF THE CLUSTER CORONA PRODUCT OF KM AND CN

: Distance-based topological indices are graph invariants that characterize graph structures using vertex distances. In this paper, we derive closed-form expressions for several distance-based topological indices of the cluster product of complete ...
Sureshkumar R, Giridharan K, Maragathavalli S   +2 more
core   +1 more source

Edge-maximal graphs without θ 7 -graphs

, 2011
Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound of f (n; θ7, ≥ 25) by proving that
Bataineh, M.S.A., Jaradat, M.M.M., Al-Shboul, I.Y.A.   +2 more
core   +1 more source

Spectra of expansion graphs

, 1999
. Replace certain edges of a directed graph by chains and consider the eect on the spectrum of the graph. It is shown that the spectral radius decreases monotonically with the expansion and that, for a strongly connected graph that is not a single cycle,
Hans Schneider, Friedland, Shmuel, Schneider, Hans   +2 more
core   +1 more source

Heavy Subgraphs, Stability and Hamiltonicity

Discussiones Mathematicae Graph Theory, 2017
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G
Li Binlong, Ning Bo
doaj   +1 more source

Some Results on the Independence Polynomial of Unicyclic Graphs

Discussiones Mathematicae Graph Theory, 2018
Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj   +1 more source

Ideal Graph of a Graph

, 2014
: In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
R. Vasuki, R. Manoharan
core  

The Crossing Number of Join of the Generalized Petersen Graph P(3, 1) with Path and Cycle

Discussiones Mathematicae Graph Theory, 2018
There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and with
Ouyang Zhang Dong, Wang Jing, Huang Yuan Qiu   +2 more
doaj   +1 more source

Long cycles in 3-connected graphs in orientable surfaces

, 2002
In this paper we apply a cutting theorem of Thomassen to show that there is a function f: N → N such that if G is a 3-connected graph which can be embedded in the orientable surface of genus g with face-width at least f(g), then G contains a cycle of ...
Xingxing Yu
core  

Depth and Stanley depth of the edge ideals of the powers of paths and cycles

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
Let k be a positive integer. We compute depth and Stanley depth of the quotient ring of the edge ideal associated to the kth power of a path on n vertices.
Iqbal Zahid, Ishaq Muhammad
doaj   +1 more source