default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToru Araki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Yasufumi Aita, Toru Araki
:
Secure total domination number in maximal outerplanar graphs. Discret. Appl. Math. 353: 65-70 (2024)- [j29]Toru Araki:
A lower bound for secure domination number of an outerplanar graph. Discret. Appl. Math. 357: 81-85 (2024) - [j28]Toru Araki, Yasufumi Aita:
An algorithm for the secure total domination problem in proper interval graphs. Theor. Comput. Sci. 1011: 114706 (2024) - [i3]Yasufumi Aita, Toru Araki:
Secure Total Domination Number in Maximal Outerplanar Graphs. CoRR abs/2403.03404 (2024) - [i2]Toru Araki:
A Lower bound for Secure Domination Number of an Outerplanar Graph. CoRR abs/2403.06493 (2024) - 2023
- [j27]Toru Araki, Ryuya Saito:
Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang. Discret. Appl. Math. 334: 139-144 (2023) - 2022
- [j26]Toru Araki, Eito Hasegawa, Shion Kato:
Minimum Stretch Spanning Tree Problem in Operations on Trees. J. Interconnect. Networks 22(2): 2150028:1-2150028:10 (2022) - 2020
- [j25]Kosuke Nakamura, Toru Araki:
Partitioning vertices into in- and out-dominating sets in digraphs. Discret. Appl. Math. 285: 43-54 (2020)
2010 – 2019
- 2019
- [j24]Toru Araki, Ryo Yamanaka:
Secure domination in cographs. Discret. Appl. Math. 262: 179-184 (2019) - 2018
- [j23]Toru Araki, Issei Yumoto:
On the secure domination numbers of maximal outerplanar graphs. Discret. Appl. Math. 236: 23-29 (2018) - [j22]Toru Araki, Hiroka Miyazaki:
Secure domination in proper interval graphs. Discret. Appl. Math. 247: 70-76 (2018) - 2015
- [j21]Toru Araki, Masayoshi Matsushita, Yota Otachi:
Completely independent spanning trees in (partial) k-trees. Discuss. Math. Graph Theory 35(3): 427-437 (2015) - 2014
- [j20]Tamaki Nakajima, Yuuki Tanaka, Toru Araki:
Twin Domination Problems in Round Digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1192-1199 (2014) - [j19]Toru Araki:
Dirac's Condition for Completely Independent Spanning Trees. J. Graph Theory 77(3): 171-179 (2014) - [i1]Toru Araki, Shingo Osawa, Takashi Shimizu:
On the distance preserving trees in graphs. CoRR abs/1407.6416 (2014) - 2010
- [j18]Yuuki Tanaka, Yosuke Kikuchi, Toru Araki, Yukio Shibata:
Bipancyclic properties of Cayley graphs generated by transpositions. Discret. Math. 310(4): 748-754 (2010)
2000 – 2009
- 2009
- [j17]Toru Araki:
Labeling bipartite permutation graphs with a condition at distance two. Discret. Appl. Math. 157(8): 1677-1686 (2009) - [j16]Toru Araki:
Connected k-tuple twin domination in de Bruijn and Kautz digraphs. Discret. Math. 309(21): 6229-6234 (2009) - 2008
- [j15]Toru Araki:
The k-tuple twin domination in de Bruijn and Kautz digraphs. Discret. Math. 308(24): 6406-6413 (2008) - 2007
- [j14]Toru Araki:
On the k-tuple domination of de Bruijn and Kautz digraphs. Inf. Process. Lett. 104(3): 86-90 (2007) - [j13]Toru Araki, Yosuke Kikuchi:
Hamiltonian laceability of bubble-sort graphs with edge faults. Inf. Sci. 177(13): 2679-2691 (2007) - 2006
- [j12]Yosuke Kikuchi, Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. Inf. Process. Lett. 100(2): 52-59 (2006) - [j11]Toru Araki:
Hyper hamiltonian laceability of Cayley graphs generated by transpositions. Networks 48(3): 121-124 (2006) - 2005
- [j10]Aya Okashita, Toru Araki, Yukio Shibata:
Adaptive Diagnosis of Variants of the Hypercube. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(3): 728-735 (2005) - [c3]Yosuke Kikuchi, Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. ISPAN 2005: 46-51 - 2004
- [c2]Satoshi Fujita, Toru Araki:
Three-Round Adaptive Diagnosis in Binary n-Cubes. ISAAC 2004: 442-451 - [c1]Toru Araki:
Optimal Adaptive Fault Diagnosis of Cubic Hamiltonian Graphs. ISPAN 2004: 162-167 - 2003
- [j9]Aya Okashita, Toru Araki, Yukio Shibata:
An Optimal Adaptive Diagnosis of Butterfly Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1008-1018 (2003) - [j8]Toru Araki:
Edge-pancyclicity of recursive circulants. Inf. Process. Lett. 88(6): 287-292 (2003) - [j7]Toru Araki, Yukio Shibata:
(t, k)-Diagnosable System: A Generalization of the PMC Models. IEEE Trans. Computers 52(7): 971-975 (2003) - 2002
- [j6]Toru Araki, Masayuki Kogure, Yukio Shibata:
Combinatorial properties of the divisibilty of mn by am + bn + c. Ars Comb. 64: 3- (2002) - [j5]Toru Araki, Yukio Shibata:
Optimal Diagnosable Systems on Cayley Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(2): 455-462 (2002) - [j4]Toru Araki, Yukio Shibata:
Efficient Diagnosis Algorithms on Butterfly Networks under the Comparison Approach. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(4): 842-848 (2002) - [j3]Toru Araki, Yukio Shibata:
Diagnosability of Butterfly Networks under the Comparison Approach. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1152-1160 (2002) - [j2]Toru Araki, Yukio Shibata:
Pancyclicity of recursive circulant graphs. Inf. Process. Lett. 81(4): 187-190 (2002)
1990 – 1999
- 1999
- [j1]Toru Araki, Yukio Shibata:
Isomorphic factorization of complete bipartite graph into forest. Ars Comb. 53 (1999)
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-08-05 21:15 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:
