Standard Jet DBnb` Ugr@?~1y0̝cßFN`7ߜ(L`{6߱(oC43ky[.*"rښUf_Љ$g'DeFxbT4.0}"dvAYSY Y Y
Y Y
Y
Y Y
Y
Y Y
Y Y 2Y Y Y Y ConnectDatabaseDateCreateDateUpdate
FlagsForeignNameIdLvLvExtraLvModuleLvPropName
OwnerParentIdRmtInfoLongRmtInfoShortTypeYYIdParentIdName
OYFSY Y Y Y 2ACMFInheritableObjectIdSID AtYObjectId
YSY Y Y Y
Y
Y Y Y AttributeExpressionFlagLvExtra
Name1
Name2ObjectId
Ordernzf
edY"ObjectIdAttributeYSY Y Y
Y
Y
Y
Y
Y ccolumn
grbiticolumnszColumnszObject$szReferencedColumn$szReferencedObjectszRelationship
YYYszObject$szReferencedObjectszRelationshipYv1b
N
:k&
W
C t/ @@ OJmJJMMQkkfJUQkOJmJLJkQkSdi`k`dOo^QkiQ^JmYdbkWYfkiQfdimkkMiYfmk
kvkiQ^mJL^Qk`kvkJMMQkkdL[QMmk`kvkJMMQkku`^`kvkJMQk`kvkbJqfJbQUidofMJmQUdiYQk`kvkbJqfJbQUidofk`kvkbJqfJbQUidofmddL[QMmk`kvkbJqfJbQdL[QMmYOk`kvkdL[QMmk`kvkhoQiYQk`kvkiQ^JmYdbkWYfkfJfQikMW#JMMQkk^Jvdom`kvkOLko``JivYbSd okQiOQSYbQO
H
@ @ @
Qbfp @ @ @ @ @ @ @ @ @ !"#$%&'()*+,./0123
456789Q@QAQBbCbDbEfFfGfHpIpJpK
d_
Z
7T
_
g ppn@n@
MSysNavPaneObjectIDs14MR2KeepLocal
TJJJJJJJH @fԨm@Ԩm@
MSysNavPaneGroupToObjects14MR2KeepLocal
TTTTTTTTR @bΨm@Ψm@
MSysNavPaneGroups14MR2KeepLocal
TDDDDDDDB @Qɧm@m@
MSysNavPaneGroupCategories14MR2KeepLocal
TVVVVVVVT @,t&k@R@AccessLayout14MR2KeepLocal
T"@'zz:::::::8 @e k@C k@MSysAccessXML14MR2KeepLocal
T<<<<<<<: @^2 k@l@papersch1@tBBB66666664 @Ҧk@Ҧk@DataAccessPages1@@@@@@@@@@> Ҧk@Ҧk@SysRel1.........., Ҧk@Ҧk@Modules10000000000. Ҧk@Ҧk@Scripts10000000000. Ҧk@Ҧk@Reports10000000000. Ҧk@Ҧk@Forms1,,,,,,,,,,* 1k@1k@UserDefined1A@DDD88888886 @1k@1k@SummaryInfo1Վ@DDD88888886 @k@^k@MSysAccessObjects1DDDDDDDDDDB k@k@MSysRelationships0DDDDDDDDDDB k@k@MSysQueries088888888886 k@k@MSysACEs022222222220 k@k@MSysObjects088888888886 k@(s@MSysDb1@(:::......., @k@k@Relationships0<<<<<<<<<<: k@k@Databases044444444442 k@k@Tables0.........., XL{hUB/A
S
@
,
B
/
l Y 2o\I"rrrrrrr_K8%p0
pT3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
p1
f0
fT3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
f1
b0
bT3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
b1
Q0
QT3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
Q1
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
1
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
1
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
1
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
0
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
1
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
T3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
T3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
3L:L>T@!Q\mOrtbͧ*aǦX:C=ÉfGP>0RyW!ZY5cd+m
0p
0
1
1
1
0
1
0
1
1
1
1
LVAL?r111111111111111111111111111111111111111111111111111111111MR2lValidationRuleValidationTextOrientationFilterOrderByOrderByOnNameMapDefaultViewGUIDColumnWidthColumnOrderColumnHiddenDescriptionFormatDecimalPlacesInputMaskCaptionDefaultValueRequiredDisplayControlSmartTagsAllowZeroLengthIMEModeIMESentenceMode$UnicodeCompression"DatasheetFontName&DatasheetFontHeight&DatasheetFontWeight&DatasheetFontItalic,DatasheetFontUnderlineTabularCharSetTabularFamily$DatasheetForeColor (
U{~ O0',rxdq9@papersch(x$^H\V{~ O0',rAuthorm5HʖC({~ O0',rTitle:56"N5{=Q{~ O0',rNumber of copies {~ O0',rVN[papersch].Author, [papersch].Title
Arial
" Author
m AEvn
Title 6
m s& Number of copies
MR2lValidationRuleValidationTextOrientationFilterOrderByOrderByOnNameMapDefaultViewGUIDColumnWidthColumnOrderColumnHiddenDescriptionFormatDecimalPlacesInputMaskCaptionDefaultValueRequiredDisplayControlSmartTagsAllowZeroLengthIMEModeIMESentenceMode$UnicodeCompression"DatasheetFontName&DatasheetFontHeight&DatasheetFontWeight&DatasheetFontItalic,DatasheetFontUnderlineTabularCharSetTabularFamily$DatasheetForeColor (
U{~ O0',rxdq9@papersch(x$^H\V{~ O0',rAuthorm5HʖC({~ O0',rTitle:56"N5{=Q{~ O0',rNumber of copies {~ O0',rVN[papersch].Author, [papersch].Title
Arial
" Author
m AEvnMR2ANSI Query Mode(Themed Form ControlsAccessVersion
BuildProjVerN
08.50WMR2ANSI Query Mode(Themed Form ControlsAccessVersion
BuildProjVerN
08.50WMR2( ReplicateProject MR20
TitleAuthorCompanyZ.
&Databasepapersch
User
HOME Y NY Y DataIDDDpYAOIndexv1
"K[< i32ϑu igccessObjects1DDDDDDDDDDB K[> Root Entry8L
PropDataForms0M0MReports0M0MRoot Entry~cL
PropDataForms0M0MReports0M0M
Modules0M0MScripts0M0MVBA0M~cLCmdbars0M0MCustomGroups 0M0MDirDataVBAProjectM~cLAcessVBADataDataAccessPages 0M0MDatabases
0M0vpM0
0MQאMBlobK[
!"#$%&'()*+,./012345jiMSysDbID="{A19FD4F656EA4464B057885241A25E89}"
Name="Databasepapersch"
HelpContextID="0"
VersionCompatible32="393222000"
CMG="DDDF111B71CF75CF75CF75CF75"
DPB="8D8F41EB419A429A429A"
GC="3D3FF1BB116A126A1295"
[Host Extender Info]
&H00000001={3832D640CF9011CF8E4300A0C911005A};VBE;&H00000000
00
VBAАM~cLPROJECTwmPROJECT0_VBA_PROJECT ܱ0* pH*d<DatabasepaperscThx@
=
&^JJ<
9stdole>stdoleP
h%^*\G{00020430C
0046}#2.0#0#C:\Windows\SysWOW64\e2.tlb#OLE Automation0DAO>JDAOA
A5E0
1A5AProgram Files (x86)\@Common \Microsoft Shared\>\dao360.dll# 3.6 Object LibraryKADODB>
AD]DB___108CPAA006D2EA4AP1CP/Vtem\@ado\ms@21WGActModules0M0MScripts0M0MVBA0M8LCmdbars0M0MCustomGroups 0M0MDirDataVBAProjectM8LAcessVBADatadir ImExSpecsж@0ж@0
!"#$%&'()*+,./012345K[iveX A.s 2T.1/D+am: *\G{000204EF00000000C000000000000046}#4.0#9#C:\PROGRA~2\COMMON~1\MICROS~1\VBA\VBA6\VBE6.DLL#Visual Basic For Applications*\G{4AFFC9A05F99101BAF4E00AA003F0F07}#9.0#0#C:\Program Files (x86)\Microsoft Office\Office12\MSACC.OLB#Microsoft Access 12.0 Object Library*\G{0002043000000000C000000000000046}#2.0#0#C:\Windows\SysWOW64\stdole2.tlb#OLE Automation(*\G{00025E0100000000C000000000000046}#5.0#0#C:\Program Files (x86)\Common Files\Microsoft Shared\DAO\dao360.dll#Microsoft DAO 3.6 Object Library**\G{0000020100000010800000AA006D2EA4}#2.1#0#C:\Program Files (x86)\Common Files\System\ado\msado21.tlb#Microsoft ActiveX Data Objects 2.1 Library
&^Jx
%AccessVBAWin16~Win32MacVBA6#Databasepaperschstdole`DAOADODBsH
jiMSysDbID="{A19FD4F656EA4464B057885241A25E89}"
Name="Databasepapersch"
HelpContextID="0"
VersionCompatible32="393222000"
CMG="CBC907128A168A168A168A16"
DPB="52509E9B249C249C24"
GC="D9DB15A616A61659"
[Host Extender Info]
&H00000001={3832D640CF9011CF8E4300A0C911005A};VBE;&H00000000
00
000000
VBAАM8LPROJECTwmPROJECT(_VBA_PROJECT ܱ0* pH*d<DatabasepaperscThx@
=
&^JJ<
9stdole>stdoleP
h%^*\G{FY4E`S
N)
Y d
Y Y Author
Title Number of copies Y Number of copies Number of copiesv11x0BS
Y NY 0Y Y
Y
Y L7
Y 7IdLValueObjectGuidObjectNameProperty
ValueL7L7L7L7L7L7L7L7L7LYYYId$ObjectGuidProperty$ObjectNamePropertyHv1b@ <.?N0
̈́
nj
_
Il ]HlJE"DTC?y:AeAGroMerCutpoints, lobes and the spectra of gr+GroMerCutpoints, lobes and the spectra of graphsB;*GutRosSpectral moments of polymer graphs:;1)GutRectifying a misbelief: Frank Harary's role in the discovery of the coefficient theorem in chemical graph theory;3(GutRosSpectral moments of polymer graphs:;'CheLiuGraphs with extremal nullity4;&GuoYanYehOn the nullity and the matching number of unicyclic graphsU;%FioLofPucOn the density, chromatic number and chromatic index of a graphZ;$FonThe path polynomial of a complete graph<;#FonThe path polynomial of a complete graph<;"FioManA theorem on planar graphs with an application to the reconstruction problem. IIh;!FioThe chromatic index of graphs: a survey<;; FiorThe chromatic index of graphs: a survey=;<FiorOn the chromatic index of a graph, III: uniquely edgecolourable graphs];FioWeight odd parameters and spectra of graphs@;
!,FiorOn the chromatic index of a graph, III: uniquely edgecolourable grpahs];FenYuNo starlike trees are Laplacian cospectralA;ErdFajHofMaximum degree in graphs of diameter 2A;EtoExistence and connectivity of planar graphs having 12 vertices of degree 5 and n  12 vertices of degree 6;EllBasic subgraphs and graph spectra6;EhoFehHonGhost systems: a vertex algebra point of viewH;4DomHatHenMarRestrained domination in graphs with minimm degree 2R;DooA note on eigenvalues of a line graph:;DooCveOn spectral characterizations and embeddings of graphsN;DroSerSerThe structure of locally finite 2connected graphsM;DenThe independence number of graphs with large odd girthK;7Doo3DobOn the function "sandwiched" between (G) and (G)M;DedSalKirA particular class of bigraphs9;DedLa ricostruibilita' del polinomio caratteristico del commutato di un grafo_;
DedPorSome properties of a multigraph by semiincidence matricesR;CveRowSimOn some algorithmic investigations of star positions of graphsY;CveRowLargest eigenvalue*;
CveSimOn graphs whose second largest eigenvalues does not exceed ("5  1)/2`; CveGutThe algebraic multiplicity of the number zero in the spectrum of a bipartite graphj; !CveLepSeeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive result;CvePetTables of graph spectra/;CveSimGraph theoratical results obtained by the support of the expert system ,,GRAPH"g;CveMarOn infinite graphs with 3 and 4 nonzero eigenvaluesL;WCvePetA table of connected graphs on 6 verticesA;CvePevDiscussing graph theory with a computer III, manmachine theorem proving`;CveThe generating function for variations with restriThe generating function for variations with restrictions and paths of the graph and selfcomplementary graphsG?% 3$
#%&()*+!!!!!!!!!
!!!!!!!!!!!!!!!!!!!"!#!$!%!&!'!(!*!+!,!!.!0!3,,,,,,,, ,
,,,
,,,,,,,,,,,,,,!,#,$,%,',(,),*,+,,,,.,/,0 

 "#$%&'()*+,./0123///////// /
///
///////////////// /!/"/#/$/%/&/'/(/)/*/+0000000 000
000000000000000000!0"0$0%0&0'0(0)0,00/0001020311111111111
111111111111111 1!1#1%1&1'1(1*1+1,11.1/1112222222 2
222222222222222222 2!2"2$2%2&2'2(2)2*2+2,22.2/202233333333 33
333333333333333333 3!3"3#3$3%3&3'3)3*3+3,33.3/444444 4
444
444444444444444444 4!4"4#4$4%4&4'4(4)4+4.4/40555555 5
55
5555555555555555 5!5"5#5%5'5(5*5+5,55.5/50516666666666666666666666666666 6!6"6#6$6%6&6(6)6*777777777 7
777
77777777777777 7!7#7%7&7(7*7+7,8888888 8
88
888888888888 8!8"8$8%8)8*8,88.8/8283999999 9
999
9999999999999999 9!9"9#9$9%9&9'9(9)9*9+9.:::::::: :::
::::::::::::::: :!:":$:%:&:(:*:+:,::.:/:1;;;;;;;;; ",!! !1!2,,,,,,, ,&//00#0+1 111"22
2212344445555$5&6 6
66
777)888'9999,9::::#:):0$!00.11)22434177$7'888+9:
11381$4,04JN@M
OM
<l
m
6
ɰ } < HA!Ay4X8E9'B?=@LepOn canonical graphs and eigenvectors of graphs?
>Lep
LeiMuzStrongly regular Cayley graphs over the group Zpn+ZpnI
LehAn optimal algorithm to detectt a line graph and output its root graphW
LazOn graphs whose reduced energy does not exceed 3A
LawSokBounds on the L2 spectrum for Markov chains and Markov processes: a generalisation of Cheeger's inequality~
6LauOn a formula for the number of Euler trails for a class of digraphsT
LauOn a formula for the number of Euler trails for a class of digraphsT
=Lau
LauReconstruction numbers of graphs1
LafSzaCounting simplexes in R3,
Planar and nonplanar graphs; Line graphs; Factorisation; MatricesM
HarOuterplanar graphs#
HarOrbits method for Sl(2,R)*
HofOn Moore graphs with diameters 2 and 38
9HedJacLas
HolWhiOn matching equivalent graphs1
KobKnGaps in the chromatic spectrum of faceconstrained plane graphsS
KloThe switch chromatic number of a graph7
KumRaoSinGraphs with eigenvalues at least 2:
KruDistinct degrees determined by subgraphs9
Koo(Mou)Maximal energy graphs+
JarProblems of quality assessment in higher educationC
HozThe eigenvalues of the Laplacian for the homology of the Lie algebra corresponding to a posetn
DeLaGraSome elementary lower bounds on the matching number of bipartite graphs\
Matchings
SchBaiSumming a curious, slowly convergent series?
8Kan
OmiOn the nullity of bipartite graphs3
The linear shape functions Li, Lj, Lk for a triangular element N
AxeFonOn rainbow arithmetic progressions6
DurFrom tyres to neutrinos(
SpeMore graph invariant inequality conjectures<
BorIntersecting systems of signed sets4
SarEquidistribution and primes,
FioMitThe spectra of some families of digraphs<
AshGhoJalThe Pi and edge Szeged polynomials of a family of fullerene graphsY
KliReiShifted set families, degree sequences, and plethysmH
HarGraph diagrams
RanSivComputing Nsign number of certain identity and nonidentity graphsW
GroThe triangle of Pascal and its history7
FioGarYerOn a class of polynomials and its relation with the spectra and diameters of graphsn;CveApplications to chemistry and other branches of scienceL;4HerPlanarity; Colourability; Matrices7;03GroSome remarks on Celtic mathematics7;2GroSome remarks on Celtic mathematics7;/1GutRelation between the Laplacian and the ordinary characteristic polynomial^;0GutYehFuGraph transformations which preserve the multiplicity of an eigenvalue`;/GutKenQuiWiener numbers of random benzenoid chainsD;2.Gut3GutCveThe reconstruction problem for characteristic polynomials of graphs[;,GroMerWatLaplacian unimodular equivalence of graphsE;K[00020430C
0046}#2.0#0#C:\Windows\SysWOW64\e2.tlb#OLE Automation0DAO>JDAOA
A5E0
1A5AProgram Files (x86)\@Common \Microsoft Shared\>\dao360.dll# 3.6 Object LibraryKADODB>
AD]DB___108CPAA006D2EA4AP1CP/Vtem\@ado\ms@21WGActdir ImExSpecsж@0ж@0iveX A.s 2T.1/D+am: *\G{000204EF00000000C000000000000046}#4.0#9#C:\PROGRA~2\COMMON~1\MICROS~1\VBA\VBA6\VBE6.DLL#Visual Basic For Applications*\G{4AFFC9A05F99101BAF4E00AA003F0F07}#9.0#0#C:\Program Files (x86)\Microsoft Office\Office12\MSACC.OLB#Microsoft Access 12.0 Object Library*\G{0002043000000000C000000000000046}#2.0#0#C:\Windows\SysWOW64\stdole2.tlb#OLE Automation(*\G{00025E0100000000C000000000000046}#5.0#0#C:\Program Files (x86)\Common Files\Microsoft Shared\DAO\dao360.dll#Microsoft DAO 3.6 Object Library**\G{0000020100000010800000AA006D2EA4}#2.1#0#C:\Program Files (x86)\Common Files\System\ado\msado21.tlb#Microsoft ActiveX Data Objects 2.1 Library
&^Jx
%AccessVBAWin16~Win32MacVBA6#Databasepaperschstdole`DAOADODBsH
LVALMR2dValidationRuleValidationTextOrientationFilterOrderByOrderByOnNameMapDefaultViewGUIDColumnWidthColumnOrderColumnHiddenDescriptionFormatDecimalPlacesInputMaskCaptionDefaultValueRequiredDisplayControlSmartTagsAllowZeroLengthIMEModeIMESentenceMode$UnicodeCompression"DatasheetFontName&DatasheetFontHeight&DatasheetFontWeight&DatasheetFontItalic,DatasheetFontUnderlineTabularCharSetTabularFamily$DatasheetForeColor(DatasheetForeColor128DisplayViewsOnSharePointSiteTotalsRowFilterOnLoadOrderByOnLoadHideNewFieldTextAlignAggregateType (
U{~ O0',rl֠u@papersch$oxC>V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]V
Title 9
m '( 4Iݣ(%& Number of copies
0
m '( :V]
8ˀ6U
/
IU Uy@eZRFlh"onMarHidden edges in graph coloring/
onFowPicTodMyrConduction in graphenes1
onCheSharp bound of the kth eigenvalue if trees;
onCarCveGraphs with least eigenvalue 2 attaining a convex quadratic upper bound for the stability numberu
onCarCveRowSimA sharp lower bound for the least eigenvalue of the signless Laplacian fo a nonbipartite graphy
onBorGutNullity of graphs%
onAkbGhoMahOn graphs whose star sets are (cocliques)A
CanMonSynchronising graphs(
CryPerfect numbers
MicBranching extent and spectra of trees6
RucGutThe branching extent of graphs2
JohSaiEstimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
BeeTrees with very few eigenvalues0
BriOleDriSchur complements of matrices with acyclic bipartite graphsR
SimOn graphs whose second largest eigenvlaue is less than ("5  1)/ 2 (summary only)e
GutCveThe reconstruction problem for characteristic polynomials of graphsW
FrKnCovering a graph with cuts of minimum total size (+ abstract)Q
LinLi vanReeSplitting systems and separating systemsB
BezFroRosKovOn biclique coverings/
BarFalOn two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matricesm
onThe cubic equation
onIseExpansions that grow on trees.
onSanZhaPlanar graphs of maximum degree seven and class IE
onJiaOn a conjecture about trees in graphs with large girthG
onAlbColSymmetry breaking in graphs/
onBeiWil (eds)Chapter 8 Symmetry from Selected topics in graph theoryQ
onTsuSymmetry and symmetry breaking in particle physicsC
onPasFourdimensional football, fullerenes and diagram geometryK
onGutRelation between the Laplacian and the ordinary characteristic polynomialZ
vnTyuDieTad
onSciFowOn nut and core singular fullerenes (referee's report)J
onTypes of graphs
onGutImpact of the Sachs theorem on theoratical chemistry: A participant's testimony`
onCarKamLozMaximum
onGonFanYinOn the nullity if graphs with pendant treesB
onTechniques and problems in graph theory  Abstracts?
onLepGutPetOn canonical graphs and the Laplacian characteristic polynomialV
onTorOn infinite graphs with three and four nonzero eigenvaluesL
onLepSome results on the reduced energy of graphs=
onPowStructure of a matrix according to its second eigenvectorJ
GerStSpectral theory and dpacking nmbers for the generalized Petersen graphs^
Chapter 1: Molecular biology(
LiOn the nullity of graphs with pendant vertices>
CarDelRamLaplacian eigenvectors and eigenvalues and almost equitable partitions]
CarKamLozMaximum kregular induced subgraphs:
GonFanYinOn the nullity of graphs with pendant treesB
Techniques and problems in graph theory  Abstracts?
LepGutPetOn canonical graphs and the Laplacian characteristic polynomialV
TorOn infinite graphs with three or four nonzero eigenvaluesK
Graphs and groups (handwritten notes) CHECK@
652
x
H
@KO5KKK
Z
@J)J Ii * vH*c:NR v*FonSanSanTree decomposition by eigenvectors6
onAtkChiPhiTables of group theory
onHaeInterlacing eigenvalues and graphs3
onLakVijClique irreducibility and clique vertex irreducibility of graphsT
onYuaAn eigenvector condition for reconstructibility@
onKotLovThe rank and size of graphs/
onAkbCamKhoRanks and signatures of adjacency matricesA
onQiaFanOn the nullity of graphs with cut edges;
onXuXuSharp bounds for the spectral radius of digraphsB
onBruSolOn the spectral radius of connected graphs>
onLsConstruction of carbon nanotube junctions:
onLsRasFowGraTopological coordinates for toroidal structuresI
onLsTopologically determined electronic energy levels and matching problemsX
onLsMenExistence of stable electronic energy levels in the presence of vibrational and offdiagonal disordery
onLsGraph theoretical study of topologically determined electronic energy levels]
onKugLsConnection between topology and electron structure in amorphous carbon_
onDenSatWuHomomorphisms, representations and characteristic polynomials of digraphs_
onStaOn graphs whose second largest eigenvalue equals 1  the star complement techniquec
onHuXueLiuOn the nullity of bicyclic graphs7
onPicFowAn analytic model for steadystate currents in conjugated systemsU
onFowPicTodEquiconducting molecular conductors:
onFow et alFragment analysis of singlemolecule conductionF
onFowRosSymmetry and distortive electrons in two and threedimensional conjugated systemsk
onFowSymmetry aspects of distortivity in systemsA
nFow
onVinMolecular symmetry and group theory4
onCohVarDuality between packings and coverings of the Hamming spaceO
onLauConstructing LDPC codes from groups4
onLauCayley graphs, pseudosimilar edges and line graphsC
}nHae
onWanOn graphs whose signless Laplacian index does not exceed 4.5M
n
{nRow
onJacRowOn graphs with complete bipartite star complementsF
onCveRowSimSome characterizations of graphs by star complementsK
znRow
ynGod
wnCox
onNgoLecture 10: Introduction to algebraic graph theoryC
onTorA property of canonical graphs/
unLap
on
onMerA survey of graph Laplacians
onGutPraOn the origin of high Hckel molecular orbital degeneracyM
onGutThe number of eigenvalues greater than two in the Laplacian spectrum of a graph`
onGutSome properties of Laplacian eigenvectors:
onGutDistance line graphs%
onSchOn strongly regular graphs and configurations n_3B
onYuOn maximal signless Laplacian spectral radius of graphs with given matching numberb
onWanHuaBelLimThe graphs whose signless Laplacian index is bounded by 4.5U
onSolThe second eigenvalue of regular graphs of given girthG
onSimToaThe index of trees with specified maximum degreeF
onPetOn graphs with exactly one eigenvalue less than 1C
GutCmiMilRadDependence of total electron energy on the number of nonbonding molecular orbitalsr
NonBreAlgbre et graphes: notions avancs4
onWanXuSome results on the spectral reconstruction problemF
LepOn formal products and Siedel spectrum of graphs (+ referee's report)V
1/D"N

LV
#
t $ 3?>a#$E"CWAfCarYusGraphs having the local decomposition propertyB
CarOn graphs determined by their ksubgraphs:
CaoYuaGraphs characterised by the second eigenvalueA
BruSheDiameter of the NEPS of bipartite graphs<
@Big
DejGiuOn unitary Cayley graphs,
PalThe exponentiation group as the automorphism group of a graphN
RobEnumeration of Euler graphs,
NorA class of strongly regular graphs3
BraPisAnother infinite sequence of dense trianglefree graphsK
5HarKinMowRea
PethThe linear relationship between stoichiometry and dimensional analysisX
PetFetEquilibrium calculation at mixed crystals crystallization in double exchange reaction systemsq
PethOn a class of solutions of algebraic homogeneous linear equationsS
YehGutFuGraph transformations which preserve the multiplicity of an eigenvalue\
BonA graph reconstructor's manual/
BonHemGraph reconstruction  A survey3
BonOn Ulam's conjecture for separable graphs:
ErdUlam, the man and the mathematician4
FioLauThe reconstruction of maximal planar graphs 1. RecognitionN
MyrEllHofBidegreed graphs are edge reconstructible@
MyrThe allyreconstruction number of a tree with five or more vertices is three]
BolAlmost every graph has reconstruction number threeC
LauProof of Harary's conjecture on the reconstruction of treesL
BloBlocking sets in Desarguesian planes, recent developmentsJ
BeuCombinatorics in infinite geometries is easy=
BelPortfolio optimisation in finance: an introductionC
BehA selection of topics (1. Labelled enumeration; 9. Graphs and groups; 10. Graph isomorphism and reconstruction; 13. The Ramsey numbers)
BeeRieSmiUsing minimum degree to bound average distanceE
BarHolLoeGraphs whose minimal rank is two: The finite fields caseO
AscLauOn disconnected graph with large reconstruction numberJ
AlePapOn coset coverings of solutions of homogeneous cubic equations over finite fieldse
AnsFerSalSmall forbidden configurations II8
AloEigenvalues and expanders*
AldOn the Markov chain simulation method for uniform combinatorial distributions and simulated annealingv
AgnFelTroThe maximum number of adges in a graph of bounded dimension, with applications to ring theoryt
AbaKorLarClassification of maximal caps in PG(3,5)@
LovSchThe Colin de Verdire number of linklessly embeddable graphsP
?Lov
LovHypergraphs; Ramsey theory+
DesRaoA characteristic of the smallest eigenvalue of a graphJ
LiuIntroduction to combinatorial maths4
LiZhoMinimal energy of bipartite unicyclic graphs of a given bipartitionV
:CheHalLiWei
HenOn isomorphisms of finite Cayley graphs  a surveyC
LepSome results on the reduced energy of graphs, IIIB
LepOn conjugate characteristic polynomial of a graphB
LepGutPetOn canonical graphs and the Laplacian characteristic polynomialV
FioA theorem on planar graphs with an application to the recosntruction problem, Id;A4`$qN$
y
$;
;
 ! HdH!ǒV`JLaAx@RayCharacterization of line graphs0
KCraLibSol (editors)
GraMafGraphs whose choice number is equal to their chromatic numberQ
BryGraph theory and electrical networks5
SciOn the eigenspaces of graphs  Introduction<
JHedHedLas
FauRouSchEdgedisjoint Hamiltonian cycles7
BagBeiSome results on binary matrices obtained via bipartite tournamentsV
BagOn upsets in bipartite tournaments3
Kan[a, b]factorizations of nearly bipartite graphsA
JohRelating metrics, lines and variables defined>
BolTo prove and conjecture: Paul Erds and his mathematicsH
Dud (editor)Reviews (Coo: variste Galois, 18111832 by Laura Toti Rigatelli; Wim: The fast Fourier transform workshop by Richard and Sandra McPeak)
Law (editor)Notes (New: Euler's function on arithmetic progressions; Fis: A note on Weyl's inequality; Kan: Minimal polynomials over cyclotomic fields)
BurMorFermat's last theorem, the four color conjecture, and Bill Clinton for April Fools' Dayk
GooThe inversesimilarity problem for real orthogonal matricesL
DelTilThe spectrum of de Bruijn and Kautz graphs>
BroRieThe spectrum of the second subconstituent of the bilinear forms graph H_q(d, e)c
RicWarGood matrices: Matrices that preserve ideals@
HerHow to do and write math research2
SchSpectral reconstruction problems1
GodMcKFeasibility conditions for the existence of walkregular graphsS
GutChemistry and algebra&
BiySimStaSome notes on spectra of cographs8
IGutRos
GraFullerene patches I$
HDezFow RasRog
Excerpt (graphs, & , singular fullerenes: pgs 2  5)B
PirGutEnergy of a graph is never the square root of an odd integerP
AldLiDiversity of graphs with highly variable connectivityH
FenYuLiMinimising the Laplacian eiegenvalues for trees with given domination numbera
CusFinite vectorspaces and certain lattices:
KnuTaoHoneycombs and sums of Hermitian matrices=
CuoMathematics for teaching)
Ba
Antimagic labelings of antiprisms3
CowOn the total chromatic number of Steiner systemsA
CouRusNote on the method of molecular orbitals<
ColOstSchEdgecoloring bipartite multigraphs in 0(ElogD) timeK
CleMacHebThe riskadjusted performance of closedend funds and the impact of discountsd
ChuGraLeiGuessing secrets'
ChaVanZhaOn the planarity of iterated jump graphs?
CamStaA prolific construction of strongly regular graphs with the ne.c. property_
SchWilOn the eigenvalues of a graph1
CamPaul Erds: a memoir%
BusStas Busygin's NPcompleteness page4
BucHarThe chromatic and achromatic status of a graphB
ABraDraCheVol
BigAlgorithms for learning and coloring5
BerRulShaOn BochnerKrall orthogonal polynomial systemsE
HemBeiLine graphs and line digraphs1
BehChaFosGraph isomorphism and reconstruction;
#FonA note on the multiplicities of the eigenvalues of a graphO;Dominating sets and eigenvalues of graphs CHECKB
,pD
M
J
g
N vH'9`UDCxCYo,FarGreOn reconstructing the circuit polynomial of a graphG
FarGreSome analytical properties of the circuit polynomial of a graphS
FarOn a general class of graph polynomials8
FarOn Fpolynomials and reconstruction4
FarThe impact of Fpolynomials in graph theory<
FarThe subgraph polynomial and its relation to some other graph polynomialsY
FarOn relationships between clique polynomials, adjoint polynomials and uniquely colourable graphsp
FarOn Fpolynomials of thistles
FarAn introduction to Fgraphs, a graphtheoratic representation of natural numbersa
BFarMultiplicity
FarPermanental roots and the star degree of a graphA
LiPraIsomorphisms of finite Cayley digraphs of bounded valencyL
MyrRecent results on the ally reconstruction problemB
MMol
LauEdgereconstruction number of planar graphs with minimum valency 5S
KraEllMyrLegitimate number decks for trees8
MyrThe allyreconstruction number of a disconnected graphG
AloCarKraRadCombinatorial reconstruction problems?
RosThe B and Apolynomials of the generalised rooted product of weighted (di) graphsd
RosStriking spectral properties of the arcgraph>
RosThe maximality of the normalizer of an automorphic subgroup with respect to permuting intact orbits of this subgroup
RosSome complementary methods for investigating the generalised symmetry and topology of a molecular graph with a given subspectrum
VerMultiplicities of eigenvalues and treewidth of graphsG
VinYanReconstruction of the set of branches of a graphD
LFriKanA simple algorithm for constructing Szemer>
SacGraph theory in organic chemistry: problems and methods in the chemistry of carbon footballs and tubes (fullerenes)
BerRadScoWanWarAll trees contain a large inuced subgraph having all degrees 1 (mod k)c
SacWozOn graphs which contain each tree of given sizeE
FruHarSelfcomplementary generalized orbits of a permutation groupP
ScoReconstructing sequences)
BurStr"You can sum some of the series some of the time and some of the series none of the time & but can you sum some of the series all the time?"
HorOlkWhen does A*A = B*B and why does one want to know?F
PruDiscrete convolutionrearrangement inequalities and the FaberKrahn inequality on regular treesp
RayOn some connections between graph theory and experimental designs and some recent existence resultst
WinOn graphs which are metric spaces of negative typeC
WilAnalysis situs
WhiSpanning trees in program flowgraphs5
CheVal JolOn spectra of simple random walks on onerelator groups  Appendix: An upper bound for the norms of powers of normalised adjacency operators
BraPacking constants in graphs and connectivity=
LinAlgebraic graph theory: eigenvalue techniques>
AloEigenvalues, geometric expanders and sorting in roundsG
GutIviOn Matula numbers%
HofRayOn the line graph of a systematic balanced incomplete block designV
1GutRectifying a misbelief: Frank Harary's role in the discovery of the coefficient theorem in chemical graph theory;K4Z.
L
^%M
+Jz "IHHn2FY w.aPFOpen problems related to Venn diagrams2
Spe(Note) Minimal completely separating systems=
ChuOn the coverings of graphs+
KwaWanRegular maps with Frobenius graphs6
CarOn fans in multigraphs'
LazOn graphs whose reduced energy does not exceed 3 (+ referee's report)V
HosAbelisation of quasihypergroups, H_vrings and transposition H_vgroups as a categorical reflectionu
ChaFranklin's argument proves an identity of ZagierA
RowThe main eigenvalues of a graph: a survey:
GutRectifying a misbelief: Frank Harary's role in the discovery of the coefficienttheorem in chemical graph theory
BolTanOn the nullity of unicyclic graphs6
TerMain eigenvalues and automorphisms of a graph>
ChoLeeClosedform evaluation of a class of series associated with the Riemann zeta functioni
JacElementary solid geometry*
ZgrOn quasiabelian Cayley graphs.
YuFenNew upper bounds of Laplacian energy7
BolTanOn graphs with large nullity0
BolTanOn the nullity of bicyclic graphs5
RouBalChemical applications of graph theory (in Applications of graph theory [ed: Wil & Bei])k
WilSingular graphs
WilDiagonal sums of boxed plane partitions8
N
CV of WC Chu
WanPath factors of bipartite graphs1
Vitaly Ivanovich Voloshin%
DamHaeWhich graphs are determined by their spectrum?B
TutAll the King's horses&
JohSaiEstimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
D
CPublications
HesOn the use of graphs in group theory5
EHarVinWorA poinsymmetric graph that is nowhere else reversibleM
HagThe characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertexdeleted subgraphs and their complements
hGutThe star is the tree with greatest greater Laplacian eigenvalueP
GriMonochroma symmetric subsets at 2colourings of groupsG
WatGraDesigns. Matroid theory+
GodProblems in algebraic combinatorics4
GodKraRodReconstructing graphs from their kedge deleted subgraphsP
GerTowards a closed description of observation processesF
GanTextbook excerpt!
Liber Amicorum (Dr. Albert Ganada).
Fri et al.Reducing the adjacency matrix of a tree?
Sums of powers of the roots of an equation  Newton's theoremI
Catlin memorial workshop on graph minors, & (schedule)E
FioLofPucOn the density, chromatic number and chromatic index of a graphV
FioThe development of mathematical education in Malta in 1978: A case study of crosscultural influencesv
FioSpectra of trees!
FioGarYebBoundary graphs: the limit case of a spectral propertyM
FioA quasispectral characterisation of strongly distanceregular graphsV
FarA survey of the unifying effects of Fpolynomials in combinatorics and graph theoryd
FarWahComputing with Fgraphs+
3GroHamiltonian graphs from Kirkman to Knig=;4@c;
S
"
t'EK+K
y

] c {G
d2qD
]%Gs=zWilSingular graphs
ChuInversion techniques and combinatorial identitiesB
WhiCongruent graphs and the connectivity of graphs@
WatSchIntegral starlike trees+
VolOrganic chemistry"
VisUnion of all the minimum cycle bases of a graph@
ZivTriRanOn conjugated molecules with identical topological spectraQ
TsoSymmetry and symmetry breaking in particle physicsC
van NufA bound for the chromatic number of a graph@
SzePolyhedral decompositions of cubic graphs:
LafSzaCounting simplexes in R^3
SinA theorem for qualitative deductions in organic or inorganic chemistry regarding the relative stabilities, distortions and reactions of molecules
SysA labelling algorithm to recognise a line digraph and output its root graph\
PSimSome notes on graphs whose second largest eigenvalue is less than (T
SimOn the largest eigenvalue of bicyclic graphs=
SimAn algorithm to recognize a generalised line graph and output its root graph]
SeiManuscript for Chapter X of "Mathematical recreations and essays" (Combinatorial designs)j
SeiDiscrete mathematics (notes pack)2
SciOn the ranks of graphs'
RouA max {m, n} algorithm for determining the graph H from its line graph GY
RowDominating sets and eigenvalues of graphs:
RowA deletioncontraction algorithm for the characteristic polynomial of a multigraphc
GRowThe spectrum of a graph modified by the addition of a vertexM
SudA note on odd cyclecomplete graph Ramsey numbersB
RadSimWhich bicyclic graphs are reflexive?8
RowDooSimThe Ulam graph reconstruction problem<
SchSpectral reconstruction problems1
Crossing number of graphs%
KulAkkBeiOn line graphs with crossing number 1<
RowGraph angles and isospectral molecules7
HooThe size of bipartite graphs with a given girth@
CveLepRowSimThe maximal exceptional graphs8
SanZhaOn the size of edge chromatic critical graphsA
He et al.Edgepartitions of planar graphs and their game coloring numbersW
JouChaAlgorithmic aspects of counting independence setsE
F
<SchWilOn the eigenvalues of a graph1
HilJahSome problems about rfactorizations of complete graphsK
AndNakSelfcomplementary graphs with minimum degree twoE
CheFau JacFragile graphs with small independent cutsB
XGut et alDependence of total pielectron energy on the number of nonbonding molecular orbitalsm
GutChemistry and algebra&
SteMilliondollar minesweeper+
RanA historical approach to maximum and minimum problemsF
RouMathematics with molecules+
Nonnegative matrices
MITACS (magazine)
BetMinimum Lee weights of type II codes over F_2^r* (TO CHECK)L
DiaGamRandom matrices, magic square and matching polynomialsJ
WoaArea of Catalan paths&
)GutOn independent vertices and edges of belt graphsE;D5G0
ͧ
=
7JʍJ#
M LAF{6;wPc
fSchAlmost all trees are cospectral0
WatSchIntegral starlike trees+
XueGuoOn integral trees problems.
RoiAn infinite family of integral graphs6
TutThe use of numerical computations in the enumerative theory of planar maps[
AlbHutHodwiger's conjecture and six chromatic toroidal graphsK
IlzOn the problem of selecting conductor coloring?
GreLovApplications of product coloring4
MitOn the various algorithms for estimating the chromatic number of a graphY
Solutions to problems in Eureka No. 91
MitA short proof of Catlin's extension of the theorem of BrooksM
FraA six color problem$
GelStaThe chromatic number and other functions of the lexicographic productY
CarA theorem on fans in multigraphs1
BerKahIs the fourcolor conjecture almost false?>
AppHakThe four color theorem is proved4
Lau(Note) On a formula for the number of Euler trails for a class of digraphs[
LauProof of Harary's conjecture on the reconstruction of treesL
GrAcyclic colorings of planar graphs3
HofSinOn Moore graphs with diameters 2 and 3:
GoeSciStrongly regular graphs derived from combinatorial designsN
(Graphs and groups (handwritten notes)1
WagFastplttbare Graphen&
VasRalAlgorithms for De Bruijn sequences  a case study in the empirical analysis of algorithmsm
RobGraph theory and social sciences1
Scientific paper by Ivan Gutman (regarding the spectra of trees)L
GutOn an upper bound for Laplacian eigenvalues<
GutA spectral property of graphs.
LiThe distribution of Laplacian eigenvalues of graphsC
BigPerfect codes in graphs(
MitExcess edges in trianglefree critical graphs>
Qde Ver
SciOn the coefficient of in the characteristic polynomial of graphs of nullity onee
SciOn the coefficient of in the characteristic polynomial of singular graphs_
`HarSchWhich graph have integral spectra?6
ClaA graph polynomial and its applications8
LovPlanar graphs and eigenvalues.
CveDooSimSome results on generalised line graphs>
BruThe incidence matrix of a graph0
SpiThe atom connectivity matrix (ACM) and its characteristic polynomial (AC MCP)^
HarSchThe spectral approach to determine the number of walks in a graphU
ZhaThe edgereconstruction of maximal bipartite planar graphs with minimum valency 3b
ZhaA note of edgereconstruction.
ZhaOn the edgereconstruction of 3connected planar graphs with minimum valency 4_
ReaCorThe graph isomorphism disease1
WilThe colouring of graphs(
WilThe eigenvalues of a graph and its chromatic numberD
YemSome properties of Hamiltonian symmetries:
YemDynamical symmetries of Hamiltonian systems<
WilWhich polynomials are chromatic?1
ZhoGuaOn the edgeface total colouring of planar graphsE
.GutRelation between the Laplacian and the ordinary characteristic polynomial^;0o
2
zˊJqJ7
X 0V6GF`PnRA^.xtAlbHutGraph color extensions: When Hadwiger's conjecture and embeddings helpZ
xtEvaAn "expository" proof of Goldbach conjecture=
xtMinCharacteristic roots%
xtCamLinear transformations and matrices4
VtBigRegular graphs and digraphs,
xtEvaIn defense of Mr Fermat(
xtErdSpiraling the Earth with C.G.J. Jacobi (exerpt)@
xtWilHamiltonian paths and Cayley digraphs of algebraic groupsJ
xtBakAlgebra and number theory*
xtSieSpectral theory and geometric representation of substitutions (Ch 7 in Arithmetics and combinatorics of substitutions)
xtBerSieBasic notation on substitutions (Ch 1 in Arithmetics and combinatorics of substitutions)l
xtvanDamGraphs with few eigenvalues  An interplay between combinatorics and algebra`
xtvanDamRegular graphs with four eigenvalues8
xtTheBurQueen domination of hexagonal hives7
xtDunHayHenThe codomatic number of a cubic graph<
xtFigMeiPicLocal conditions for edgecoloring9
xtChe et al.On the upper linedistinguishing and upper harmonious chromatic numbers of a graphj
xtKheKouHamiltonian cycle decompostion of Kronecker product of some cubic graphs by cyclesf
xtYehFibonacci numbers of prduct graphs3
xtGodKubResults about graph decomposition, greates common divisor index for graphs and for digraphso
xtDanA note on MAD spanning trees
UtFarKenQui
xtAdaKhoSmallest critical sets for the groups of size eightG
xtKerFriPath kernels and partitions/
xtMarDisjoint cycles in planar and trianglefree graphsC
xtHenA characterisation of graphs with minimum degree 2 and domination number exceeding a third their sizev
xtThe fundamental theory of algebra
xtBibliography
xtAnsOn a conjecture concerning forbidden submatricesA
xtCveSome results on graph angles
xtRowYuaTricyclic Hamiltonian graphs with minimal indexC
xtHuaYeoMaximal and minimal vertexcritical graphs of diameter twoN
xt(Handwritten notes) Singular pdeck/
Tt(Note) Some Oretype conditions for the existence pf connected [2, k]factors in graphsc
RtBxu(Note) On integral sum graphs.
xtTha(Note) A reconstruction problem related to balance equations II: The general caseb
CvePevDiscussing graph theory with a computer III, manmachine theorem proving\
CveThe generating function for variations with restrictions and paths of the graph and selfcomplementary graphs~
ColSinSpektren endlicher Grafen
ColSinTables of graphs$
BigAlgebraic graph theory (Copy of Chapters 2, 3, 8, 21)F
ZhaOn the edgereconstruction of maximal bipartite planar graphsN
CveDooSimGeneralized line graphs.
DooA surprising property of the least eigenvalue of a graphI
DesRooA characterisation of the smallest eigenvalue of a graphL
DooCveOn spectral characterisations and embeddings of graphsJ
(2) The spectrum of a graph; (3) Regular graphs and line graphs; (4) Cycles and cuts; (5) Spanning trees and associated structures; (6) The treenumber; (7) Determinant expansions
(GutRosA new recursion relation for the characteristic polynomial of a molecular graphg;2_=N
M
>N
h I=NY;?n<p"SchComputing the characteristic polynomial of a graphC
xtRodpadic numbers and nonarchimedian valuations>
xtReiFinite dimensions; algebras and singularity theoryC
xtRicWarDiagonalisation aover commutative rings;
xtRicWarGood matrices: Matrices that preserve ideals@
xtQin"Fivecolormap" does not exist0
xtBruPysMatrices and graphs'
\t1
xtDeoHarSchAn eigenvector characterization of cospectral graphs having cospectral joinsc
xtPowSulThe walk partition and colorations of a graphA
xtYapThe characteristic polynomial of the adjacency matrix of a multidigraphY
xtPowGraph partitioning by eigenvectors3
xtPerSch(Note) A conjecture on sets of differences of integer pairsO
xtWri(Note) Burnside's lemma: A historical note;
xtPisOn planar graphs with 12 vertices of degree fiveA
xtPriOval configurations of involutions in S_n:
xtPetSymmetric attractors and symmetric fractals<
xtPetSacber Spektrum, Automorphismengruppe und Teiler eines GraphenP
xtPatTwaAffine extension of noncrystallographic coxeter groups and quasicrystals\
xtCamStrongly regular graphs(
xtPolAsymptotic formulas for the number of selfcomplementary graphs and digraphs]
xtNieHow to find overfull subgraphs in graphs with large maximum degree, IIW
xtOther examples
xtPorStiIntegral equations  A practical treatment, from spectral theory to applications (Ch 4 Compact operators)}
xtvanNufRank and diameter of a graph0
xtPorStiIntegral equations  A practical treatment, from spectral theory to applications (Appendix A and B)w
xtNasThe reconstruction problem+
xtAkk (ed.)Graph theory newsletter (Vol 26 (No 3) Sept  Dec 1997)N
[tAkk (ed.)Graph theory newsletter (Vol 25 (No 3) SeptDec 1996)L
xtMowThe adjacency matrix and the group of a graph>
xtNarAn application of perfect matchings to surface reconstructionN
xtMusAdversary reconstruction of trees: The case of caterpillars in the sunshine (abstract only)l
xtMizSatOn the treedegree polynomial of a regular covering of a graphR
xtMitHypoproperties in graphs*
xtMelVizNew proof of Brooks' theorem0
xtMitAn extension of Brooks' theorem to ndegenerate graphsG
xtMihGeneralized colorings and inducedhereditary properties of graphsR
xtHarOn the intersection number of a graph6
xtManReconstruction of unicyclic graphs3
xtMowThe group of a graph whose adjacency matrix had all distinct eigenvaluesY
xtMagic cubology
xtDiaStructural origin of specific eigenvalues in chemical graphs of planar molecular orbital functional groups{
xtEliTaeSchultz polynomials of composite graphs;
YtHi
xtBreFaiGilA new upper bound for the (p, 6) and (p, 8)cageG
ZtBreGilGgraphs: An efficient tool for constructing symmetric an semisymmetric graphsb
xtBreFaiGilGgraphs: A new representation of groups?
xtdelaViGraSome elementary lower bounds on the matching number of bipartite graphs_
xtvanDamHaePeeEquitable resolvable coverings8
DomHatHenMarRestrained domination in graphs with minimum degree 2S;2tη
q
L>V
l

q 3 wz&ap"CBQ 6zxtAndRao's conjecture on selfcomplementary graphs with kfactorsM
xtAla et al.Graph theory with applications to algorithms and computer scienceY
xtBalTorGrafi autopposti e strutture di incidenza autodualiG
xtBenWojOn selfcomplementation+
xtCarHamiltonianconnected selfcomplementary graphs@
xtChaWhiChromaticity of selfcomplementary graphs=
xtChaKapLicSchThe partial complement of graphs:
xtStoThe falsity of the reconstruction conjecture for tournamentsM
xtSta(Note) Reductions of the graph reconstruction conjectureI
xtStoA census of nonreconstructable digraphs, I: Six related familiesR
xtChaMitGraphical theorems of the NordhausGaddum classC
xtCheSequences of degrees of edges of selfcomplementary graphsK
xtClaTriangles in selfcomplementary graphs7
xtClaHamiltonian arcs in infinite selfcomplementary graphsG
xtClaPotentially selfcomplementary degree sequences@
xtClaAn easier enumeration of selfcomplementary graphsC
xtClaKleThe degree dequences of selfcomplimentary graphsE
xtColColGraph isomorphism and selfcomplementary graphsC
xtColRod(Note) Cycle decompositions of the line graph of K_nH
xtColColIsomorphism problems involving selfcomplementary graphs and tournaments\
xtSzaGenerating minimal reactions in stoichiometry using linear algebraS
xtGolSteNonlinear dynamics of networks: The grouped formalismI
xtSta(Note) Reductions of the graph reconstruction conjectureI
xtSkuLocally Hamiltonian and planar graphs6
xtSpiThe atom connectivity matrix (ACM) and its characteristic polynomial (ACMCP)]
xtSimSolUrbInvariant measures for parabolic ifs with overlaps and random continued fractionsh
xtSimOn the largest eigenvalue of unicyclic graphs>
xtSimLiMBelOn the index of caterpillars3
xtSimKocOn the largest eigenvalue of some homeomorphic graphsI
xtSimAn algorithm to recognize a generalized line graph and output its root graph]
xtSheMinimum multiplicities of subgraphs4
xtBorMolA criterion for unimodality/
xtSheThe independence number of dense graphs with large odd girthM
xtShaWanWeakly selfavoiding words and a construction of FriedmanM
xtSarSelOn edge colorings with at least q colors in every subset of p verticesZ
xtSamPusComplement of a graph: A generalization;
xtCorLerSteComplement reducible graphs2
xtLozOn a generalization of bicomplement reducible graphsF
xtRoyThe rank of a cograph&
xtRoyThe rank of a graph$
]t
xtBelRowThe change in index of a graph resulting from the attachment of a pendant edgeb
xtRowOn the index of certain outerplanar graphs;
xtRowYuaTricyclic Hamiltonian graphs with minimal indexC
xtRosThe B and Apolynomials of the generalized rooted product of weighted (Di) graphsd
xtRicWarThe smallest matrix of given period and primitive roots of unityT
xtRoiAn infinite family of integral graphs6
xtRosWriKruskal's and Prim's greedy algorithm giving minimum weight spanning tree (excerpt)g
xtNerDirect sum of vector spaces,
HarKinMowReaCospectral graphs and digraphs8
#+FW
v
\L
^
0H^E+Fs:xtRodGraph decompositions%
xtReeRodSubdesigns in complementary path decompositions and incomplete twofold designs wigh block size fourx
xtReaOn the number of selfcomplimentary graphs and digraphsH
xtRaoSolution of the Hamiltonian problem for selfcomplementary graphsR
xtRaoThe number of open chains of length three and the parity of the number of open chains of length k in selfcomplementary graphs
xtRaoCycles in selfcomplementary graphs4
xtRaoCharacterization of selfcomplementary graphs with 2factorsM
xtRadSimIts complement have its spectrum rounded from below by 2M
xtPinSui grafi autocomplimentari,
xtPalSchThe number of selfcomplementary achiral necklacesF
xtKra1perfect codes over selfcomplementary graphs?
xtKroReaOn the construction of the selfcomplementary graphs on 12 nodesT
xtMcKGeneralized complementation,
xtNai(Note) Construction of selfcomplementary graphsA
xtMar(Mathematical notes) An eigenvalue inequality for the product of normal matricesa
=tPalAsymptotic formulas for the number fo selfcomplementary graphs and digraphs]
xtCorFamilies of graphs complete for the strong perfect graph conjectureT
xtDasIntegerpair sequences with selfcomplementary realizationsL
xtFarWhiConnections between the matching and chromatic polynomialsN
xtElZrodBlocking sets in Gdesigns/
xtGanCharacterisation of potentially bipartite selfcomplementary bipartitioned sequencese
xtGibSelfcomplementary graphs*
xtGodHenSwaSome NordhausGaddumType results8
xtHarPalRobSchEnumeration of graphs with signed points and linesL
xtHarRobThe diameter of a graph and its complement>
xtHarRobIsomorphic factorizations X: Unsolved problemsB
xtHarRobWor(Research announcement) The divisibility theorem for isomorphic factorizations of complete graphsx
xtHarRobWorIsomorphic factorisations. I: Complete graphsD
xtFarRadVijNew results on selfcomplementary graphs I: Regular selfcomplementary graphsd
xtRadVijAbout triangles in a graph and its complementA
xtWojZwoColoring edges of selfcomplementary graphs?
xtFroRos`irThe existence of selfcomplementary circulant graphsM
xtDasCharacterization of potentially selfcomplementary, selfconverse degreepair sequences for digraphsu
xtRaoExplored, semiexplored and unexplored territories in the structure theory of selfcomplementary graphs and digraphs
xtGanRaoMultipartite selfcoomplementary graphs;
xtGanRange of diameters in a graph and its bipartite complementK
xtFroDecompostions of complete multipartite graphs into selfcomplementary factors with finite diameterss
xtGanRange of diameters in a graph and its rpartite complementK
xtFroDecompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
xtAkiExoHarA graph and its complement with specified properties. V. The selfcomplement indexi
xtAkiHarA graph and its complement with specified properties. IV. Counting selfcomplementary blocksp
xtAlaLiuWanLinear vertexarboricity of complementary graphsG
LauEndvertexdeleted subgraphs,
/_!h
D
Lq+
PJ$
I v , ȒBr"Q(.c+,rMowThe adjacency matirx and the group of a graph>
The algebraic multiplicity of the number zero in the spectrum of a bipartite graph^
AscThe nonexistence of rank three permutation groups of degree 3250 and subdegree 57b
BroOn the nonexistence of a type of regular graphs of girth 5L
NeuSieDiscrete hyperbolic geometry0
WilHamiltonian paths and Cayley digraphs of algebraic groupsJ
FioLauResearch problems: Problem 171
BorIntersecting systems of signed sets4
JohSutHermitian matrices, eigenvalue multiplicities, and eigenvector components]
SimStaThe polynomial reconstruction of unicyclic graphs is uniqueO
CveGutThe algebraic multiplicity of the number zero in the spectrum of a bipartite graphf
BelLiMSimReferee report: Bidegreed trees with small indexG
SimAn algorithm to recognize a generalized line graph and output its root graph]
GroZimLarge eigenvalue of the Laplacian5
SenNonnegative matrices: An introduction to theory and applications (Appendix A  D)c
Hah`irA note on intersecting cliques in Cayley graphsF
FeiOn a generalization of linear independence in finitedimensional vector spaces_
LorSome studies in molecular orbital theory I. Resonance structures and molecular orbitals in unsaturated hydrocarbons
HofOn eigenvalues and colorings of graphs7
Sch(Note) On unimodal sequences of graphical invariantsE
EvaPulShe(Note) On the number of complete subgraphs contained in certain graphs]
MilRivThe need for indispensible amino acids: The concept of the anabolic drive]
MaaTransportation in graphs and the admittance spectrumE
EllBasic subgraphs and graph spectra2
SimA note on reconstructing the characteristic polynomial of a graphR
CveRowThe largest eigenvalue of a graph: A survey?
C_{3614} diagram
AdiZafUpper bounds for energy of a graph6
OHuaMenThe nullity of quasinonsingular graph:
Maximal energy graphs!
^DiaStructural origin of specific eigenvalues in chemical graphs of planar molecules molecular orbital functiona orbitals (+ summary)
KooMouMaximal energy bipartite graphs3
GutThe energy of a graph: old and new results;
Bre et al.AIM Laplace energy group report7
TanThe nullity of unicyclic mixed graphs6
GodMcKSpectral conditions for the reconstructibility of a graphM
Hon(Note) An eignevector condition for reconstructibilityG
xtYanLihKuoChaSigned degree sequences of signed graphsB
xtWorIsomorphic factorizations VII. Regular graphs and tournamentsN
xtSheDutBri(Note) Extension of a clique cover result to uniform hypergraphsW
xtScoIl complementare di un grafo non superiormente immergibile superiormente immergibileg
xtSchThe number of color cyclic factorizations of a graphE
xtSalSull'esistenza di particolari circuiti di ogni lunghezza di un torneo regolare autooppostol
xtSalSui circuiti di un torneo autoopposto7
xtSalCostruzione dei grafi autoopposti3
xtRodSelfcomplementary graph decompositions8
DooAn interrelation between line graphs, eigenvalues and matroidsS;4ɏg>
e%
xaLKSʴ
m
u S (N
<HEY=fCG(r(}SciSeries of minimal reactions,
LafSzaCounting simplexes in R^n
SchSpectral reconstruction problems1
CvePetA table of connected graphs on six vertices?
Spectra of graphs with seven vertices1
KaiOn a partition of P Erds*
BiyA counterexample to a conjecture of Erds:
ElzStrongly regular graphs: Values of and for which there are only finitely many feasible (v, k, , )
JohSaiEstimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
Matching
iGutThe star is the tree with greatest greatest Laplacian eigenvalueQ
RoyThe rank of a cograph&
Fri et al.Reducing the adjacency matrix of a tree?
SciOn the coefficient of in the characteristic polynomial of singular graphs_
HeuSymmetric matrices with prescribed eigenvalues and eigenvectorsP
DesRaoA characterisation of the smallest eigenvalue of a graphL
SchAlmost all trees are cospectral0
aHarSchWhich groups have integral spectra?7
ZelIntersection graphs of lattices0
Marriage in denumerate societies,
BosShrGraphs in which each pair of vertices is adjacent to the same number d of other verticesl
HubStrongly regular graphs(
JakOn certain homomorphism properties of graphs I?
KonZemNecessary and sufficient conditions for a matrix distribution to have a positivereal Laplace transform{
SciOn the construction of graphs of nullity one=
MowThe characteristic polynomial of a graph9
CveLepSeeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive result
Har et al.Cospectral graphs and digraphs6
WilSingular graphs
NanA note
Ch 25: Polycyclic benzenoid hydrocarbons and other cyclic polyenesN
ElBMatrix inverse of chemical graphs II singular graphsF
HarThe determinant of the adjacency matrix of a graphC
TutSpanning subgraphs with specified valencies<
EllBasic subgraphs and graph spectra2
GutCveThe reconstruction problem for characteristic polynomials of graphsW
SimA note on reconstructing the characteristic polynomial of a graphR
CveRomSimStar complements and exceptional graphs>
_CveSimMinimal graphs whose second largest eigenvalue is not less than (5  1)/2]
S2
GutKenSerTree singularity and a chemical background to singular graphsT
MohEigenvalues, diameter, and mean distance in graphsC
NebAlgebraic properties of Husimi trees5
SchAlmost all trees are cospectral0
DedPorAlgebraic properties of line multidigraphs of a multidigraphP
NeuThe second largest eigenvalue of a tree8
GroOn the geometry and Laplacian of a graph9
RowGraph perturbations$
RowOn the characteristic polynomials of spirographs and realted graphsT
RecRowYuaSome relatively sparse graphs with Hamiltonian cyclesL
GutCveThe reconstruction problem for characteristic polynomials of graphsW
KanCycles in graphs and groups,
3/q12
t
D;
G
L NtZ^o#]"BG]Multidimensional scaling$
TalMarkov chains (incomplete)+
GalMucPorRandom walker rannking for NCAA division I  A footballN
8) Symmetric matrices and quadratic forms5
MacThe many proofs and applications of Perron's theoremE
KeeThe PerronFrobenius theorem and the ranking of football teamsO
WilSearching the web with eigenvectors4
BoyNote on the PerronFrobenius theory of nonnegative matricesL
jvanDuyThe tetrahedral digital waveguide mesh:
MinTowards covariant matrix theory0
HarGraph theory as a structural model in the social sciencesJ
GodRoy14) Cuts and flows&
BigAlgebraic potential theory on graphs5
ConTorPacking, tiling, and covering with tetrahedraA
GraReferee report: Fullerene patches I4
GalGoogle's secret and linear algebra3
AndBerYour hit parade: The top ten mostfascinating formulas in Ramanujan's last notebookg
GleAn evaluation of mathematics competitions using item response theoryU
KliNonisomorphic cycles of maximum length in a series of chemical graphs and the problem of application of IUPAC nomenclature rules
Kli et al.The smallest nonrank 3 strongly regular graphs which satisfy the 4vertex conditionl
Kli et al.Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I Permutation groups and coherent (cellular) algebras
ZieOriented matroids today(
ZhuCircular chromatic number of planar graphs of large odd girthN
Alv et al.An extension of a criterion for unimodalityC
MuzTinRecognizing circulant graphs in polynomial time: An application to association schemesj
LiMPerfect 7cycle systems(
SheMinimum multiplicities of subgraphs and Hamiltonian cyclesK
McKWanMaximising the permanent of (0, 1)matrices and the number of extensions of Latin rectanglesp
CheAgaForest matrices around the Laplacian matrix?
Threeclass association schemes+
God(Note) 4connected maximal planar graphs are 4orderedG
MohSome applications of Laplace eigenvalues of graphsC
vanDamStrongly regular decompositions of the complete graphI
DelFavRau(Note) On the reconstruction of the degree sequenceJ
vanDamGraphs, distances and eigenvalues5
vanDamGraphs with few eigenvalues  An interplay between combinatorics and algebra (Vol. 2)i
vanDamHaeGraph with constant and bar (that is, its completment)W
ArnGeometric models of pisot substitutions and noncommutative arithmeticW
SirSolPure discrete spectrum for onedimensional substitution systems of pisot typea
CamWaiMultiplicity in coupled FitzhughNagumo oscillatorsG
SheYusA note on the number of edges guaranteeing a C_4 in Eulerian bipartite graphsa
CamCycle index, weight enumerator, and Tutte polynomialE
YehGutFuGraph transformations which preserve the multiplicity of an eigenvalue\
SeiChapter X Combinatorial designs (manuscript)=
SeiDiscrete mathematics (pack of notes)5
ClaA graph polynomial and its applications8
HedJacLasInequalities involving the rank of a graphA
Y2J#2
T
̇OX
N
9 6Ǣli<tG5GesSeoA refinement of Cayley's formula for trees>
GutKlaA theorem on Wienertype invariants for isometric subgraphs of hypercubes]
CveGutTriGraph theory and molecular orbitals.II=
CveGutThe algebraic multiplicity of the number zero in the spectrum of a bipartite graphf
Cve et al.Recent results in the theory of graph spectra  Chapter 5: Applications to chemistry and other branches of science
CveDooDevelopments in the theory of graph spectra?
CveTables of graph spectra(
CveChapter 6  Characterization of graphs by means of spectra (excerpt: section 6.3)b
CveSome possibilities of constructing graphs with given eigenvalues and angles\
CouHavHenFunctional decomposition of a class of wild polynomialsN
ClaA graph polynomial an its applications7
ChuYauCoverings, heat kernels and spanning trees>
Chrpadic numbers and ultrametricity2
CarChapter 1  An introduction to zeta functions (pgs 26  63)L
Cam et al.Line graphs, root systems and elliptic geometryG
BulVolMixed interval hypergraphs.
BucOjeIterated line graphs and cosequential graphs@
BucOjeUnique detour vertices and constant detour number graphsL
BroKenSerGraph singularity(
BorSymmetries of the Painleve equations and the connection with projective differential geometryn
BolGraph theory (pgs 68  71)+
BolChapter I  Fundamentals; Chapter II  Electrical networksK
BonHemGraph reconstruction  A survey3
BigConstructions for cubic graphs with large girth@
BelRowThe change in index of a graph resulting from the attachment of a pendant edgeb
BelRowCertain graphs without zero as an eigenvalue@
BelRowOn the index of tricyclic Hamiltonian graphs@
BehChapter 10 Graph isomorphism and reconstruction@
Beh et al.Chapter 7 Hamiltonian graphs4
BevDomMilRanks of trees and grid graphs5
BehChaLesGraphs and digraphs: Section 3.4  The girth of a graphN
Bev et al.The rank of a graph after vertex additionA
BalSimTinSome remarks on graph equation G^2 = G bar (that is its compliment)Z
BalQuantization: Motivations, constructions and examplesF
BakEigenvalues of adjacency matrices for regular graphsE
Bal et al.Connectivity of large bipartite digraphs and graphsK
Applications to vertexcolourings
AndVesGraphs with all spanning trees nonisomorphic@
CveDooSimGeneralized line graphs.
CveDooSimSome results on generalised line graphs>
GodConstructing cospectral graphs/
GilRicSpi (eds)Markov chain Monte Carlo in practiceA
OmeSanvanGulA Markovbinomial distribution8
RosMinorization conditions and convergence rates for Markov chain Monte Carlo[
RosMarkov chain convergence: from finite to infiniteB
RosConvergence rates of Markov chains3
Euler's function
ZigKimKirTexture mapping using surface flattening via multidimensional scaling]
CheHalLiWeiOn ranks of matrices associated with treesC
#/I
9
q$
[
AJ d= [?
kDelTilEigenvalues, eigenspaces and distances to subsetsE
SchThe number of color cyclic factorisation of a graphD
HilOutlines of Latin squares*
LipChapter 12: Bilinear, quadratic and Hermitean forms. Chapter 13: Inner product spaces. Handwritten notes.z
vanDamNonregular graphs with three eigenvalues<
DoyRecent developments in the theory of Steiner systemsE
CamStrongly regular graphs(
Cam (ed.)Problems from the seventeenth British combinatorial conferenceU
HaeDisconnected vertex sets and equidistant code pairsD
GyFruit salad
SzaGenerating minimal reactions in stoichiometry using linear algebraS
DsSzaOn the maximal and minimal number of cycles and bases of matroids and the extremal constructionst
&Bak
IV Brazilian workshop on continuous optimizationa and I BrazilArgentina symposium on continuous optimizationy
BakFinite groups and their representations8
SciFace recognition system for security applicationsB
CamJonThe effect of a pressure gradient on the secondary flow of nonNewtonian liquids between nonintersecting cylinders
CamJonSecondary flow of nonNewtonian liquids between confocal elliptic cylinders in relative motionr
CuoMathematics for teaching)
KnuTaoHoneycombs and sums of Hermitian matrices=
BecOn finite arithmetic progressions2
KolIn Archimedes's puzzle, a new Eureka moments=
The role of women in science(
Mathematics magazine Vol. 37, No. 4, October 2000=
KhaNenSequences of maximal degree vertices in graphsB
FioGauThe crossing number of the generalized Petersen graph P[3k, k]R
BhaEssGenerating function rationality for anisotropic vicious walk configurations on the directed square lattice~
BhaEssFermi, Bose and vicious walk configurations on the directed square lattice^
FioOn the chromatic index of a graph, III: uniquely edgecolourable graphs\;SchWil / CamOn the eigenvalues of a graph / Strongly regular graphsQ
zxtPalAsymptotic formulas for the number fo selfcomplementary graphs and digraphs CHECKk
LepOn formal products and the Siedel spectrum of graphsE
LovSpectra of graphs; Automorphisms of graphs;
BigAlgebraic graph theory (Chapters 2  9; 14)<
ƏBraDraCheVolDually chordal graphs/
FarMultiplicity of integer roots of polynomials of graphsG
ՏList of publications
ˏHowElementary linear algebra*
HarVinWorA pointsymmetric graph that is nowhere else reversibleN
RobSome properties of twocolor partitions8
RowThe spectrum of a graph modified by the addition of a vertex (CHECK)U
DezFow RasRogFullerenes as tilings of surfaces<
Paper on nonregular graphs with 3 eigenvalues:
HedHedLasDomination in trees: models and algorithmsA
\lCraLibSol (editors)Notes (IkeInaMiy: The monotonicity theorem, Cauchy's interlace theorem, and the CourantFischer theorem)
FriKanA simple algorithm for constructing Szemerdi's regularity partitionX
MolThe edge reconstruction number of a disconnected graphG
WieStructural determination of paraffin boiling pointsD
HuaMenSonThe nullity of quasinonsingular graph=
SimSome notes on graphs whose second largest eigenvalue is less than ("51)/2^
>YNXX
Y Y Y
Y Y Y Y Filter
FlagsIdNamePosition SelectedObjectIDType,,X\,YIdďxtXu (B)(Note) On integral sum graphs1
yHsuShiRepresentation of various special polynomials via the cycle indicator of symmetric groupl
zxtXu (R)(Note) Some Oretype conditions for the existence pf connected [2, k]factors in graphsk
xtFarKenQuiPermanents and determinants of graphs: A cycle polynomial approachY
ƏxtBigRegular graphs and line graphs/
CvePetA table of connected graphs on six verticesC;v1 xtHcPokerNew sufficient conditions for integral complete 3partite graphsZ
xtBreGilGgraphs: An efficient tool for constructing symmetric and semisymmetric graphsc
xtAkk (ed.)Graph theory newsletter (Vol 25 (No 3) Sept  Dec 1996)N
QmmmxtRowThe characteristic polynomials of modified graphsB
RbDiaStructural origin of specific eigenvalues in chemical graphs of planar molecules molecular orbital functional orbitals (+ summary)
CveSimMinimal graphs whose second largest eigenvalue is not less than ("5  1)/2a
HarSchWhich graph have integral spectra? CHECKD
HarSchWhich groups have integral spectra? CHECKD
RY
Ncc
Y Y Y
Y Y ,Y Y
FlagsGroupCategoryIDIdName"Object Type GroupObjectIDPosition,,cd,,,ce,YYGroupCategoryIDIdv1 @@
b @nnnnnnnn n
n
b @n nnnnnnnnn
Y
Ngg
Y Y Y Y
Y ,Y Y
FlagsGroupIDIconIdNameObjectIDPosition,,gk,,,gl,YYGroupIDIdv1GutThe star is the tree with greatest greater Laplacian eigenvalue CHECK_
GutThe star is the tree with greatest greatest Laplacian eigenvalue CHECK_
vanDuySmiThe tetrahedral digital waveguide mesh=
f @oooooooo o
o
f @oooooooooo eQyCustomgTables
u
eb
yLO"
}
}Custom Group 162.*&"
}
}
}
}
}
}
}f
yLk>
f
w b
wQ
w
w
w
w
w
w
w
wRYk@NqqY
Y kY hIdNameTypedvph=T)
M
$
HpMSysNavPaneObjectIDs2.fMSysNavPaneGroupToObjects<8bMSysNavPaneGroups,(QMSysNavPaneGroupCategories>:AccessLayout"MSysAccessXML$ paperschDataAccessPages($SysRelModulesScriptsReportsFormsUserDefined SummaryInfo MSysAccessObjects,(MSysRelationships,(MSysQueries MSysACEsMSysObjects MSysDbRelationships$ DatabasesTables QTables"
}LVAL MR2dValidationRuleValidationTextOrientationFilterOrderByOrderByOnNameMapDefaultViewGUIDColumnWidthColumnOrderColumnHiddenDescriptionFormatDecimalPlacesInputMaskCaptionDefaultValueRequiredDisplayControlSmartTagsAllowZeroLengthIMEModeIMESentenceMode$UnicodeCompression"DatasheetFontName&DatasheetFontHeight&DatasheetFontWeight&DatasheetFontItalic,DatasheetFontUnderlineTabularCharSetTabularFamily$DatasheetForeColor(DatasheetForeColor128DisplayViewsOnSharePointSiteTotalsRowFilterOnLoadOrderByOnLoadHideNewFieldTextAlignAggregateType (
U{~ O0',rl֠u@papersch$oxC>V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]V
Title 9
m '( 4Iݣ(%& Number of copies
0
m '( :V]V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]V
Title 9
m '( 4Iݣ(%& Number of copies
0
m '( :V]V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]V
Title 9
m '( 4Iݣ(%& Number of copies
0
m '( :V]V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]V
Title 9
m '( 4Iݣ(%& Number of copies
0
m '( :V]V{~ O0',rAuthor4Iݣ(%{~ O0',rTitle:V]