搜索结果: 1-15 共查到“运筹学 Graph”相关记录20条 . 查询时间(0.046 秒)
Chemical engineers and materials scientists are constantly looking for the next revolutionary material, chemical, and drug. The rise of machine-learning approaches is expediting the discovery process,...
鲁东大学运筹学课件 Lecture-Graph Theory。
三亚国际数学论坛：图与网络对称性（International Workshop on Symmetries of Graph and Networks）
三亚国际数学论坛 图与网络对称性
2018/1/11
Nowadays, graph symmetries are becoming a very important and rapidly growing area of study, and often looked at closely by computer scientists and other network designers. One significant instance of ...
三亚国际数学论坛：Structural Graph Theory and Discrete Optimization
三亚国际数学论坛 Structural Graph Theory Discrete Optimization
2017/1/11
Graph theory and discrete optimization are fundamental subjects in the fields of information theory, data analysis, network study and communication, and they have been applied widely in information te...
A new graph parameter related to bounded rank positive semidefinite matrix completions
new graph parameter bounded rank positive semidefinite matrix completions Optimization and Control
2012/4/23
The Gram dimension $\gd(G)$ of a graph $G$ is the smallest integer $k\ge 1$ such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions c...
Convex Graph Invariants
Graphs graph invariants convex optimization spectral invariants majorization
2011/1/17
The structural properties of graphs are usually characterized in terms of invariants, which
are functions of graphs that do not depend on the labeling of the nodes. In this paper we study
convex gra...
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
sufficient condition existence anti-directed 2-factor
2011/1/18
Let D be a directed graph with vertex set V and order n. An anti-directed (hamiltonian) cycle H in D is a (hamiltonian) cycle in the graph underlying D such that no pair of consecutive arcs in H form ...
W-graph ideals
W-graph ideals
2011/1/18
We introduce a concept of a W- graph ideal in a Coxeter group.The main goal of this paper is to describe how to construct a W- graph from a given W- graph ideal. The principal application of this idea...
On a lexical tree for the middle-levels graph problem
lexical tree middle-levels graph problem
2011/1/18
A conjecture of I. H´avel asserts that all middle-levels graphs Mk of the (2k + 1)-cubes possess Hamilton cycles. In this work, a tree containing all vertices of certain reduced graphs of the Mk...
The Graph Isomorphism Problem and approximate categories
Graph Isomorphism Problem approximate categories
2011/1/20
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm.
The kth power of a simple graph G, denoted Gk, is the graph with vertex set V (G)where two vertices are adjacent if they are within distance k in G. We are interested in nding lower bounds on the ave...
Some results concerning the $p$-Royden and $p$-harmonic boundaries of a graph of bounded degree
p-Royden boundary p-harmonic boundary p-harmonic function
2011/1/20
Let p be a real number greater than one and let be a connected graph of bounded degree. We show that the p-Royden boundary of with the p-harmonic boundary removed is a F-set. We...
We de ne the limiting density of a minor-closed family of simple graphs F to be the smallest
number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate
the set of ...
Perfect state transfer, graph products and equitable partitions
Perfect state transfer graph products equitable partitions
2010/12/15
We describe new constructions of graphs which exhibit perfect state transfer on continuoustime quantum walks. Our constructions are based on variants of the double cones [8, 3, 2] and the Cartesian gr...
On maximal distances in a commuting graph
Algebraically closed field Matrix algebra Centralizer
2010/12/14
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular,we show that the maximal distance can be attained only between two nondero...