The Dissimilarity Characteristic of Linear Graphs
چکیده
چکیدهای برای این سند ثبت نشده است.
اسناد مشابه
The Dissimilarity Characteristic of Linear Graphs
Linear Coloring and Linear Graphs
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology [9], and the framework through which it was studied, we introduce the linear coloring on graphs. We provide an upper bound for the chromatic number χ(G
On the Connection Between the Properties of Oriented Linear Graphs and Analyses of Lumped Physical Systems
It is necessary at the outset of this lecture to I apologize to this assemblage of mature theoreticians for talking about an essentially engineering subject. My excuse for doing so is that whereas my subject represents one of the most important current applicaI tions of the theor
Quantification of Network Structural Dissimilarities Based on Graph Embedding
Identifying and quantifying structural dissimilarities between complex networks is a fundamental challenging problem in network science. Previous comparison methods are based on the features, such as length of shortest path, degree graphlet, which may only contain part topologica
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (@) or crossing (G). Given a family of linear graphs, and a non-empty subset R ⊆ {<, @, G} of these three relations, we are inter
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (⊏) or crossing (≬). Given a family of linear graphs, and a non-empty subset R ⊆ {<,⊏, ≬}, we are interested in the MCSP problem: