Results 61 to 70 of about 144 (108)
Chordality and 2-Factors in Tough Graphs
, 2000 AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k.Inthis note it is proved that all 3 2 -tough 5-chordal graphs have a 2-factor.
Veldman, H.J. +7 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
, 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 +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
Characterizations of connected orthogonality graphs of projections of Rickert *-rings
, 2019 In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular.
Waphare, B.N., Patil, Avinash A.
core
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Structural Results For Two-Connected Networks With Rings Of Bounded Cardinality
, 1999 . We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb ...
M. Labbé, B. Fortz
core