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>>
Omidi, G.R. and Tajbakhsh, K. (2007) Starlike Trees Are Determined by Their Laplacian Spectrum. Linear Algebra and Its Applications, 422, 654-658. http://dx.doi.org/10.1016/j.laa.2006.11.028
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:
On Embedding of m-Sequential k-ary Trees into Hypercubes
Indra Rajasingh, Bharati Rajan, Ramanathan Sundara Rajan
DOI: 10.4236/am.2010.16065 5,241 Downloads 9,282 Views Citations
Pub. Date: December 27, 2010
Research on Factors of Linear Algebra Learning Effect
Xin Wang, Chong Hu, Yunhui Wang
DOI: 10.4236/jamp.2020.87104 75 Downloads 171 Views Citations
Pub. Date: July 25, 2020
Algorithm for Cost Non-preemptive Scheduling of Partial k-Trees
Yiming Li, Zhiqian Ye, Xiao Zhou
DOI: 10.4236/ojapps.2012.24B053 3,192 Downloads 4,055 Views Citations
Pub. Date: January 17, 2013
Linear Algebra Provides a Basis for Elasticity without Stress or Strain
H. H. Hardy
DOI: 10.4236/soft.2015.43003 5,734 Downloads 6,462 Views Citations
Pub. Date: December 7, 2015
On Bicomplex Representation Methods and Applications of Matrices over Quaternionic Division Algebra
Junliang Wu, Pingping Zhang
DOI: 10.4236/apm.2011.12004 4,645 Downloads 10,904 Views Citations
Pub. Date: March 30, 2011
