Results 61 to 70 of about 998 (73)

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, Hossein Nezhad Ferdoos, Mulder Henry Martyn, Narayanan N.   +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 Mathematics
In 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, Pho-on Witsarut, Vichitkunakorn Panupong   +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

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]

Linear Algebra Appl
Lederman RR, Steinerberger S.
europepmc   +1 more source