Results 71 to 80 of about 1,105 (90)
Rainbow Vertex-Connection and Forbidden Subgraphs
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
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
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
A new error estimate on uniform norm of Schwarz algorithm for elliptic quasi-variational inequalities with nonlinear source terms. [PDF]
Mehri A, Saadi S.
europepmc +1 more source
Threshold functions for asymmetric Ramsey properties involving cycles
Y. Kohayakawa, Bernd Kreuter
semanticscholar +1 more source
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Nagoor Gani A, Latha SR.
europepmc +1 more source
New upper bounds on the order of cages
F. Lazebnik, V. Ustimenko, A. Woldar
semanticscholar +1 more source
On the length of arcs in labyrinth fractals. [PDF]
Cristea LL, Leobacher G.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE
K. A. Germina
semanticscholar +1 more source

