نتایج جستجو برای: isomorphism of graphs
تعداد نتایج: 21177431 فیلتر نتایج به سال:
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.
The paper studies the structures of total and regular graphs sets three elements over fields zero characteristic. themselves are classified up to isomorphism.
A novel and effective approach is presented in this paper for solving the wellknown difficult problem of subgraph isomorphism. By integrating planning strategies with the concept of centered spanning tree, the presented approach achieves an average-case, near-linear performance. A majority of practical subgraph isomorphism problems deals with the cases of labeled graphs, which contains the NPco...
Good drawings (also known as simple topological graphs) are drawings of graphs such that any two edges intersect at most once. Such drawings have attracted attention as generalizations of geometric graphs, in connection with the crossing number, and as data structures in their own right. We are in particular interested in good drawings of the complete graph. In this extended abstract, we descri...
Let q be a prime power, Fq be the field of q elements, and k;m be positive integers. A bipartite graph G 1⁄4 Gqðk;mÞ is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over Fq, with two vertices ðp1;p2Þ 2 P and 1⁄2 l1; l2 2 L being adjacent if and only if p2 þ l2 1⁄4 p 1 l 1 . We prove that graphs Gqðk ;mÞ and Gq0 ðk 0;m0Þ are isomorphic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید