Results 241 to 250 of about 55,995 (279)

Distance based topological characterization, graph energy prediction, and NMR patterns of benzene ring embedded in P-type surface in 2D network. [PDF]

Sci Rep
Zhang X, Prabhu S, Arulperumjothi M, Prabhu SM, Arockiaraj M, Manimozhi V.   +5 more
europepmc   +1 more source

Distance domination in vertex partitioned graphs

, 2009
Frendrup, Allan, Tuza, Zsolt, Vestergaard, Preben D.   +2 more
openaire   +1 more source

A fuzzy soft planar graph with application in image segmentation. [PDF]

Sci Rep
Khan WA, Niaz AEM, Nguyen TT, Pham MH, Tong TMN, Pham HV.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Co-2-plex vertex partitions

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McClosky, Benjamin, Arellano, John D., Hicks, Illya V.   +2 more
openaire   +3 more sources

Vertex partitions and maximum degenerate subgraphs

Journal of Graph Theory, 2007
AbstractLet G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has a vertex partition S1, S2 such that G[S1] is a maximum order (p1‐1)‐degenerate subgraph of G and G[S2] is a (p2‐1)‐degenerate subgraph, where G[Si]
Martı́n Matamala
openaire   +3 more sources

Canonical Vertex Partitions

Combinatorics, Probability and Computing, 2003
Let σ be a finite relational signature, let be a set of finite complete relational structures of signature σ, and let be the countable homogeneous relational structure of signature σ which does not embed any of the structures in .When σ consists of at most binary relations and is finite, the vertex partition behaviour of is completely analysed, in ...
openaire   +1 more source

Distant Vertex Partitions of Graphs

Combinatorics, Probability and Computing, 1998
We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for
openaire   +1 more source

Vertex partitions of r-edge-colored graphs

Applied Mathematics-A Journal of Chinese Universities, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin, Zemin, Li, Xueliang
openaire   +2 more sources

Computational techniques for vertex partitioning of graphs

Journal of Chemical Information and Computer Sciences, 1990
A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens-Householder ...
X Y, Liu, K, Balasubramanian, M E, Munk
openaire   +2 more sources