设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(4)
Springer电子图书(14)
CNKI学位论文(4919)
知网期刊论文(2073)
中国地质文献-英文(2)
CNKI会议论文(4)
CNKI期刊论文0611(3)
在“
Elsevier电子期刊
”中,
命中:
3,307
条,耗时:0.0289829 秒
在所有数据库中总计命中:
7,019
条
1.
Nonsymmetric Askey-Wilson
polynomial
s and Q-
polynomial
distance-regular
graph
s
作者:
Jae-Ho Lee
jhlee@ims.is.tohoku.ac.jp
关键词:
Askey&ndash
;
Wilson
polynomial
;
Nonsymmetric Askey&ndash
;
Wilson
polynomial
;
q-Racah
polynomial
;
Nonsymmetric q-Racah
polynomial
;
DAHA of rank one
;
Distance-regular
graph
;
Q-
polynomial
刊名:Journal of Combinatorial Theory, Series A
出版年:2017
2.
Efficient computation of the characteristic
polynomial
of a threshold
graph
作者:
Martin Fü
;
rer
furer@cse.psu.edu
关键词:
Efficient algorithms
;
Threshold
graph
s
;
Characteristic
polynomial
刊名:Theoretical Computer Science
出版年:2017
3.
On a construction using commuting regular
graph
s
作者:
Marius Somodi
;
marius.somodi@uni.edu
;
Katie Burke
;
Jesse Todd
关键词:
Characteristic
polynomial
;
Ihara zeta function
;
Complexity
;
Kirchhoff index
;
Middle
graph
;
Total
graph
;
Quasitotal
graph
刊名:Discrete Mathematics
出版年:2017
4.
Editing to a planar
graph
of given degrees
作者:
Konrad K. Dabrowski
a
;
konrad.dabrowski@durham.ac.uk
;
Petr A. Golovach
b
;
petr.golovach@ii.uib.no
;
Pim van 't Hof
c
;
p.van.t.hof@hr.nl
;
Danië
;
l Paulusma
a
;
daniel.paulusma@durham.ac.uk
;
Dimitrios M. Thilikos
d
;
e
;
f
;
sedthilk@thilikos.info
关键词:
Graph
editing
;
Connected
graph
;
Planar
graph
;
Polynomial
kernel
刊名:Journal of Computer and System Sciences
出版年:2017
5.
The complexity of signed
graph
and edge-coloured
graph
homomorphisms
作者:
Richard C. Brewster
a
;
rbrewster@tru.ca
;
Florent Foucaud
b
;
florent.foucaud@gmail.com
;
Pavol Hell
c
;
pavol@sfu.ca
;
Reza Naserasr
d
;
reza@lri.fr
关键词:
Signed
graph
;
Edge-coloured
graph
;
Graph
homomorphism
;
Dichotomy theorem
刊名:Discrete Mathematics
出版年:2017
6.
Counting
polynomial
s with distinct zeros in finite fields
作者:
Haiyan Zhou
a
;
haiyanxiaodong@gmail.com
;
Li-Ping Wang
b
;
wangliping@iie.ac.cn
;
Weiqiong Wang
c
;
d
;
wqwang@chd.edu.cn
关键词:
Polynomial
s
;
Inclusion&ndash
;
exclusion principle
;
Moments subset-sum
;
Distinct coordinate sieve
;
Spectrum of
graph
s
刊名:Journal of Number Theory
出版年:2017
7.
Graph
isomorphism for
graph
classes characterized by two forbidden induced sub
graph
s
作者:
Stefan Kratsch
a
;
stefan.kratsch@tu-berlin.de
;
Pascal Schweitzer
b
;
schweitzer@informatik.rwth-aachen.de
关键词:
Graph
isomorphism
;
Graph
classes
;
Forbidden induced sub
graph
s
刊名:Discrete Applied Mathematics
出版年:2017
8.
An infinite family of 2-connected
graph
s that have reliability factorisations
作者:
Kerri Morgan
;
kerri.morgan@monash.edu
;
Rui Chen
rui.chen@monash.edu
关键词:
Network reliability
;
Reliability
polynomial
;
Chromatic
polynomial
;
Tutte
polynomial
刊名:Discrete Applied Mathematics
出版年:2017
9.
Harmonious colourings of
graph
s
作者:
Ewa Drgas-Burchardt
;
E.Drgas-Burchardt@wmie.uz.zgora.pl
;
Katarzyna Gibek
katarzynagibek@wp.pl
关键词:
Nordhaus&ndash
;
Gaddum type theorem
;
Graph
polynomial
s
;
Harmonious colourings
刊名:Discrete Applied Mathematics
出版年:2017
10.
Graph
parameters from symplectic group invariants
作者:
Guus Regts
a
;
1
;
guusregts@gmail.com
;
Bart Sevenster
b
;
blsevenster@gmail.com
关键词:
Partition function
;
Graph
parameter
;
Symplectic group
;
Cycle partition
polynomial
;
Edge-coloring model
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(3307)
题名(263)
关键词(433)
文摘(2910)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.