Results 51 to 60 of about 99 (66)
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
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
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
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
A Note on the Interval Function of a Disconnected Graph
Discussiones Mathematicae Graph Theory, 2018 In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Changat Manoj +3 more
doaj +1 more source
On Radio Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring.
Marinescu-Ghemeci Ruxandra
doaj +1 more source
On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
A new error estimate on uniform norm of Schwarz algorithm for elliptic quasi-variational inequalities with nonlinear source terms. [PDF]
J Inequal Appl, 2018 Mehri A, Saadi S.
europepmc +1 more source
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 Nagoor Gani A, Latha SR.
europepmc +1 more source
On the length of arcs in labyrinth fractals. [PDF]
Mon Hefte Math, 2018 Cristea LL, Leobacher G.
europepmc +1 more source