CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS最新文献

筛选
英文 中文
Rainbow Vertex Connection Number pada Keluarga Graf Roda
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-06-30 DOI: 10.25037/cgantjma.v3i1.71
F. Firman., D. Dafik, E. R. Albirri
{"title":"Rainbow Vertex Connection Number pada Keluarga Graf Roda","authors":"F. Firman., D. Dafik, E. R. Albirri","doi":"10.25037/cgantjma.v3i1.71","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.71","url":null,"abstract":"The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph $G$ is called rainbow vertex connection number which is denoted $rvc(G)$. The result of the research are the rainbow vertex connection number of family wheel graphs.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130738290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Roda 地动反射在拉轮家庭中的局部斑点斑点
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-06-30 DOI: 10.25037/cgantjma.v3i1.73
Tommi Sanjaya Putra, D. Dafik, E. R. Albirri
{"title":"Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Roda","authors":"Tommi Sanjaya Putra, D. Dafik, E. R. Albirri","doi":"10.25037/cgantjma.v3i1.73","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.73","url":null,"abstract":"All graph in this paper is simple and connected graph where $V(G)$ is vertex set and $E(G)$ is edge set. Let function $f : V(G)longrightarrow {0, 2,..., 2k_v}$ as vertex labeling and a function $f: E(G)longrightarrow {1, 2,..., k_e}$ as edge labeling where $k=max{2k_v,k_e}$ for $k_v,k_e$ are natural number. The weight of vertex $ u,vin V(G) $ under $f$ is $w(u)=f(u)+ Sigma_{uv in E(G)} f(uv)$. In other words, the function $f$ is called local vertex irregular reflexive labeling if every two adjacent vertices has distinct weight and weight of a vertex is defined as the sum of the labels of vertex and the labels of all edges incident this vertex When we assign each vertex of $G$ with a color of the vertex weight $w(uv)$, thus we say the graph G admits a local vertex irregular reflexive coloring. The minimum number of colors produced from local vertex irregular reflexive coloring of graph $G$ is reflexive local irregular chromatic number denoted by $chi_{lrvs}(G).$ Furthermore, the minimum $k$ required such that $chi_{lrvs}(G)=chi(G)$ is called a local reflexive vertex color strength, denoted by emph{lrvcs}$(G)$. In this paper, we learn about the local vertex irregular reflexive coloring and obtain emph{lrvcs}$(G)$ of wheel related graphs.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122210245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Penerapan Teknik Partisi Langkah Kuda Papan Catur pada Pelabelan Super (a,d)-P_2 (▷) ̇ H-Antimagic Total Covering Sebarang Dua Graf dan Aplikasinya
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-06-27 DOI: 10.25037/cgantjma.v3i1.79
A. Rahmatillah, I. Agustin, Dafik Dafik
{"title":"Penerapan Teknik Partisi Langkah Kuda Papan Catur pada Pelabelan Super (a,d)-P_2 (▷) ̇ H-Antimagic Total Covering Sebarang Dua Graf dan Aplikasinya","authors":"A. Rahmatillah, I. Agustin, Dafik Dafik","doi":"10.25037/cgantjma.v3i1.79","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.79","url":null,"abstract":"Let  be a finite collection of simple, nontrivial and undirected graphs. A graph  is as antimagic total covering if there is bijectif  function  for every subgraph in which isomorfic to  and the total  weight,  form arithmetic sequence , in which a,b are integers and n is a number of graph cover of which the result of total comb product operation. A antimagic total covering  is as \"super\" if smallest label is used for vertex labelling. The way for labelling a graph this time, using a knight move partition techniques application. The graph use total comb product operation . Take a copy of  and a number  of , then put the  copy of -sequence in graph vertex  to -sequence vertex of  and put the  copy of -sequence in graft edge  to -sequence edge of  is definition of total comb product. In this article, will be investigated about Knight Move Partition Techniques Application in Labelling Super Antimagic Total Covering for Any Two Graphs and Its Application (in Constructing Ciphertext).","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131204620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic Unicyclic家庭的局部发病率
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-03-08 DOI: 10.25037/cgantjma.v2i2.59
Khilyah Munawaroh, A. I. Kristiana, E. R. Albirri, D. Dafik, R. Adawiyah
{"title":"Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic","authors":"Khilyah Munawaroh, A. I. Kristiana, E. R. Albirri, D. Dafik, R. Adawiyah","doi":"10.25037/cgantjma.v2i2.59","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.59","url":null,"abstract":"In this research is a development of local irregularity vertex coloring of graph. The based on definition, as follows: textbf{$l:V(G) longrightarrow {{1, 2, ..., k}}$} is called vertex irregular k-labelling and textbf{$w:V(G) longrightarrow N$} where textbf{$w(u) = varSigma_{ v in N(u)}l(v)$}, $w$ is called local irregularity vertex coloring. A condition for $w$ to be a local irregularity vertex coloring, If textit{opt$(l)$ = min{maks$(li); li$, vertex labelling function}, and for every textbf{$u,vin E(G),w(u)ne w(v)$}. The chromatic number local irregularity vertex coloring is denoted by $chi_{lis}(G)$. In this paper, the researchers will discuss of local irregularity vertex coloring of related unicyclic graphs and we have found the exact value of their chromatic number local irregularity, namely cricket graph, net graph, tadpole graph, textit{peach} graph, and bull graph.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133683608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Pengembangan Perangkat Research-Based Learning dengan Pendekatan STEM dalam Meningkatkan Metaliterasi Peserta Didik Menyelesaikan Masalah Himpunan Pasangan Berurutan 以STEM方法改进学习者分级顺序伙伴关系问题的研究工具的发展
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-03-08 DOI: 10.25037/cgantjma.v2i2.64
Excelsa Suli Wildhatul Jannah, D. Dafik, Arif Fatahillah
{"title":"Pengembangan Perangkat Research-Based Learning dengan Pendekatan STEM dalam Meningkatkan Metaliterasi Peserta Didik Menyelesaikan Masalah Himpunan Pasangan Berurutan","authors":"Excelsa Suli Wildhatul Jannah, D. Dafik, Arif Fatahillah","doi":"10.25037/cgantjma.v2i2.64","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.64","url":null,"abstract":"The ability of metaliteracy is very important in the industrial era 4.0. Metaliteracy is a comprehensive framework of thinking that goes beyond other literacies with the main literacy being information literacy. It is indicated that the metaliteracy of students is still low, it is because this literacy is still relatively new. The use of the IoT in learning is also still uneven, including the learning model used by teachers has not been able to fully support the formation of this ability. Therefore, in this study, the Research-Based Learning model which is integrated with the STEM approach (Science, Technology, Engineering, Mathematics) will be applied to solve the STEM problem of flight scheduling. Students are introduced to the application in the form of a set of sequential pairs, then with the representation of the set of points and lines a specific schedule is drawn up and includes its generalizations. The next step is how to bring STEM problem solving in learning class, then the developed RBL and STEM tools in learning to improve students' metaliteracy. From the results of the study, it was found that the RBL device with the STEM approach developed met the valid, effective, and practice criteria.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128424541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analisis Rainbow Antimagic Coloring Pada Hasil Operasi Comb Graf Lintasan
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2022-03-08 DOI: 10.25037/cgantjma.v2i2.63
Feby Suryandana
{"title":"Analisis Rainbow Antimagic Coloring Pada Hasil Operasi Comb Graf Lintasan","authors":"Feby Suryandana","doi":"10.25037/cgantjma.v2i2.63","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.63","url":null,"abstract":"All the graphs in this paper are connected graphs. Let $G=(V,E)$ where $V(G)$ is a set of vertex from graph $G$ while $E(G)$ is a set of edge from graph $G$. A bijection function $f: V rightarrow {1,2,3,...,lvert V(G)rvert}$ the associated weight of an edge $uv in E(G)$ under $f$ is $W_f{(uv)}=f(u)+f(v)$. A path $P$ in a vertex-labeled graph $G$ is said to be a rainbow path if for every two edges $uv$, $u'v' in E(P)$, there is $w_f{(uv)}neq w_f{u'v'}$. If for every two vertices $u$ and $v$ of $G$, there is a rainbow $u$-$v$ path, then $f$ is called a rainbow antimagic labeling of $G$. A graph $G$ is rainbow antimagic if $G$ has a rainbow antimagic labeling. The minimum number of color needed to make $G$ rainbow connected, called rainbow antimagic connection number, denoted by rac(G). In this paper, we will analyze the rainbow antimagic coloring on comb product of path graph.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123029878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pengembangan Media Pembelajaran Berbasis TI pada Materi Penyajian Data Kelas VII untuk Meningkatkan Hasil Belajar 基于TI的学习媒体发展的七年级数据展示材料,以提高学习成绩
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2021-12-28 DOI: 10.25037/cgantjma.v2i2.60
Dinar Dwi Yuliyanti, A. Kristiana, Lioni Anka Monalisa
{"title":"Pengembangan Media Pembelajaran Berbasis TI pada Materi Penyajian Data Kelas VII untuk Meningkatkan Hasil Belajar","authors":"Dinar Dwi Yuliyanti, A. Kristiana, Lioni Anka Monalisa","doi":"10.25037/cgantjma.v2i2.60","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.60","url":null,"abstract":"The development of technology has a very big influence in various fields of human life, especially in the field of education. One of its uses is as a tool in the learning process. Technology-based learning can make learning more interesting, effective and efficient, so that students are more enthusiastic about learning and easy to understand the material presented. The model used is the Thiagarajan or 4-D model which consists of four stages, namely the define, design, develop, and dissenimante stages. There are three data collection techniques carried out in this study, namely validity, obtained through validation by the validator; practicality, obtained from media user response questionnaires by students; effectiveness, obtained through the results of student learning tests after using the media. The results showed that the correlation coefficient with a valid interpretation was very high at 0.94. The results of the media user response questionnaire with a percentage of 88.25%. The results of the learning test with a percentage of completeness reaching 85.18% indicate that the learning media can be categorized as effective. ","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123993436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analisa Himpunan Dominasi Lokasi pada Model Topologi Graf Khusus dan Operasinya 分析x光片及其操作的位置控制模式
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2021-12-28 DOI: 10.25037/cgantjma.v2i2.65
Reyka Bella Desvandai, I. Agustin, Kusbudiono Kusbudiono
{"title":"Analisa Himpunan Dominasi Lokasi pada Model Topologi Graf Khusus dan Operasinya","authors":"Reyka Bella Desvandai, I. Agustin, Kusbudiono Kusbudiono","doi":"10.25037/cgantjma.v2i2.65","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.65","url":null,"abstract":"Misalkan $G=(V,E)$ adalah graf sederhana tidak berarah dan terhubung dengan himpunan titik $V$ dan himpunan sisi $E$. Himpunan $Din V(G)$ dikatakan himpunan dominasi lokasi dari suatu graf terhubung $G$ jika setiap dua titik yang berbeda $u,v in V(G) D$, $N(u)cap Dneq N(v)cap D$. Kardinalitas minimal dari himpunan dominasi lokasi disebut nilai himpunan dominasi lokasi dari graf $G$ yang disimbolkan dengan $gamma_L(G)$. Penelitian ini menghasilkan nilai himpunan dominasi lokasi pada beberapa graf khusus dan operasinya.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124966140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Nilai Ketidakteraturan Total Selimut pada Graf 这种毯子的总不规则值为格拉夫
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2021-12-28 DOI: 10.25037/cgantjma.v2i2.67
Yessy Eki Fajar Reksi, D. Dafik, I. Agustin
{"title":"Nilai Ketidakteraturan Total Selimut pada Graf","authors":"Yessy Eki Fajar Reksi, D. Dafik, I. Agustin","doi":"10.25037/cgantjma.v2i2.67","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.67","url":null,"abstract":"Misal $G$ dan $K$ adalah graf sederhana, nontrivial dan graf tak berarah. Operasi emph{total comb product} menghasilkan graf baru dengan mengoperasikan dua buah graf. Misalkan emph{G} dan emph{K} adalah graf terhubung dan emph{v} $in$ emph{V(K}) dan emph{e} $ in $ emph{E(K)}. Operasi emph{total comb product} dari graf emph{G} dan emph{K} yang dinotasikan ($G$ $dot{unrhd}$ $K$) merupakan operasi graf yang diperoleh dengan mengambil salinan satu graf emph{G} dan $|V(G)|+|E(G)|$ salinan emph{K}, kemudian merekatkan salinan ke-emph{i} dari graf emph{K} di titik cangkok emph{v} pada titik ke-emph{i} dari graf emph{G} dan merekatkan salinan ke-emph{j} dari graf emph{K} di sisi cangkok emph{e} pada sisi ke-emph{j} dari graf emph{G}. Pelabelan total didefinisikan suatu fungsi $f : V(G) cup E(G) rightarrow {1,2,3,...,k}$ merupakan pelabelan emph{k-total} pada graf $G$. Pelabelan emph{k-total} dikatakan pelabelan total ketidakteraturan selimut pada graf $G$ jika untuk $H subseteq G$ dengan kata lain $H$ merupakan selimut dari suatu graf $G$, bobot total selimut $W(H)=Sigma_{vin V(H)}f(v)+Sigma_{ein E(H)}f(e)$ berbeda. Nilai minimum $k$ pada pelabelan total ketidakteraturan selimut disebut dengan emph{total H-Irregularity Strength} dari suatu graf $G$ yang dinotasikan dengan $tHs(G)$. Pada artikel ini dilakukan penelitian tentang pelabelan total ketidakteraturan selimut yaitu mencari nilai ketidakteraturan total selimut pada graf hasil operasi emph{total comb product} dari graf khusus.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116692166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analisis Gelombang Air Laut dengan Menggunakan Pemodelan Berbasis Matlab 使用Matlab的模型分析海水波
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pub Date : 2021-12-28 DOI: 10.25037/cgantjma.v2i2.68
Z. Ridlo, Luthfin Afafa, Efrika Marsya Ulfa, Mawardani Adi Pratama Dewi, Siti Maimuna
{"title":"Analisis Gelombang Air Laut dengan Menggunakan Pemodelan Berbasis Matlab","authors":"Z. Ridlo, Luthfin Afafa, Efrika Marsya Ulfa, Mawardani Adi Pratama Dewi, Siti Maimuna","doi":"10.25037/cgantjma.v2i2.68","DOIUrl":"https://doi.org/10.25037/cgantjma.v2i2.68","url":null,"abstract":"Waves are the propagation of energy from one place to another without dragging the material in its path. The waves on Papuma Beach are classified as technical waves because they require a medium to propagate and transfer the required energy. When the waves move at a certain height, the waves on Papuma Beach have a potential force. This potential force depends on the height of an object. When the waves on Papuma Beach get higher, it also has high potential energy. The method used in this research is the analysis of physical concepts related to the indigenous. Research method of analyzing the concept of physics, analyze the formulas and quantities used coding the MATLAB for making illustrations and to calculate the formulas. Potential energy is formulated with. The energy in the waves is a combination of kinetic energy and potential energyand thanproduce the formula.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132372872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信