Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
Noy, M. (2003) Graphs Determined by Polynomial Invariants. Theoretical Computer Science, 307, 365-384.
has been cited by the following article:
TITLE: On the Spectral Characterization of H-Shape Trees
AUTHORS: Shengbiao Hu
KEYWORDS: Spectra of Graphs, Cospectral Graphs, Spectra Radius, H-Shape Trees, Determined by Its Spectrum
JOURNAL NAME: Advances in Linear Algebra & Matrix Theory, Vol.4 No.2, May 15, 2014
ABSTRACT: A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. An H-shape is a tree with exactly two of its vertices having maximal degree 3. In this paper, a formula of counting the number of closed 6-walks is given on a graph, and some necessary conditions of a graph Γ cospectral to an H-shape are given.
Related Articles:
The Schultz Index and Schultz Polynomial of the Jahangir Graphs J 5, m
Mohammad Reza Farahani, Wei Gao
DOI: 10.4236/am.2015.614204 5,122 Downloads 5,936 Views Citations
Pub. Date: December 31, 2015
Zero-M-Cordial Labeling of Some Graphs
Freeda Selvanayagom, Robinson S. Chellathurai
DOI: 10.4236/am.2012.311228 3,316 Downloads 5,010 Views Citations
Pub. Date: November 20, 2012
Interactive Computer-Centered Instructions for Science and Engineering Education
Mohammad A. Matin
DOI: 10.4236/ce.2012.33059 6,419 Downloads 9,142 Views Citations
Pub. Date: June 20, 2012
Computer Science: The Third Pillar of Medical Education
Frank Lau, Lindsay Katona, Joseph M. Rosen, Charles Everett Koop
DOI: 10.4236/ce.2012.326120 5,788 Downloads 8,993 Views Citations
Pub. Date: October 24, 2012
Student-Centered Learning Objects to Support the Self-Regulated Learning of Computer Science
Ali Alharbi, Frans Henskens, Michael Hannaford
DOI: 10.4236/ce.2012.326116 4,694 Downloads 7,499 Views Citations
