default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuji Taniguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Alexander L. Gavrilyuk
, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Signed analogue of line graphs and their smallest eigenvalues. J. Graph Theory 98(2): 309-325 (2021)- [j8]Sho Kubota, Etsuo Segawa, Tetsuji Taniguchi:
Quantum walks defined by digraphs and generalized Hermitian adjacency matrices. Quantum Inf. Process. 20(3): 1-30 (2021)
2010 – 2019
- 2019
- [j7]Sho Kubota, Tetsuji Taniguchi, Kiyoto Yoshino:
On graphs with the smallest eigenvalue at least -1 - √2, part III. Ars Math. Contemp. 17(2): 555-579 (2019) - 2017
- [c2]Hideo Hirose, Masanori Takatou, Yusuke Yamauchi, Fujio Kubo, Tetsuji Taniguchi, Mitsunori Imaoka, Tetsuya Koyama:
Rediscovery of Initial Habituation Importance Learned from Analytics of Learning Check Testing in Mathematics for Undergraduate Students. IIAI-AAI 2017: 482-486 - 2016
- [c1]Hideo Hirose, Masanori Takatou, Yusuke Yamauchi, Tetsuji Taniguchi, Tatsuhiro Honda, Fujio Kubo, Mitsunori Imaoka, Tetsuya Koyama:
Questions and Answers Database Construction for Adaptive Online IRT Testing Systems: Analysis Course and Linear Algebra Course. IIAI-AAI 2016: 433-438 - 2015
- [j6]Gary R. W. Greaves, Jack H. Koolen, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Edge-signed graphs with smallest eigenvalue greater than -2. J. Comb. Theory B 110: 90-111 (2015) - 2014
- [j5]Hye Jin Jang, Jack H. Koolen, Akihiro Munemasa, Tetsuji Taniguchi:
On fat Hoffman graphs with smallest eigenvalue at least -3. Ars Math. Contemp. 7(1): 105-121 (2014) - [j4]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least -1 - τ. Ars Math. Contemp. 7(1): 247-262 (2014) - [j3]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. Discret. Appl. Math. 176: 78-88 (2014) - [i3]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
On the smallest eigenvalues of the line graphs of some trees. CoRR abs/1405.3475 (2014) - 2012
- [j2]Tetsuji Taniguchi:
On graphs with the smallest eigenvalue at least -1 - √2, Part II. Ars Math. Contemp. 5(2): 243-258 (2012) - [i2]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue greater than -3. CoRR abs/1211.3929 (2012) - 2011
- [i1]Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$. CoRR abs/1111.7284 (2011)
2000 – 2009
- 2008
- [j1]Tetsuji Taniguchi:
On graphs with the smallest eigenvalue at least -1 - √2, part I. Ars Math. Contemp. 1(1): 81-98 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
