Pub Date : 2021-05-24DOI: 10.9734/BPI/TPMCS/V11/1498A
R. Moran, Aditya Pegu, I. J. Gogoi, A. Bharali
For a graph G = (V,E) and a finite set T of positive integers containing zero, ST-coloring of a graph G is a coloring of the vertices with non negative integers such that for any two vertices of an edge, the absolute differences between the colors of the vertices does not belong to a fixed set T of non negative integers containing zero and for any two distinct edges their absolute differences between the colors of their vertices are distinct. The minimum number of colors needed for an efficient Strong T coloring of a graph is known as ST-Chromatic number. This communication is concerned with the ST-coloring of some non perfect graphs viz. Petersen graph, Double Wheel graph, Helm graph, Flower graph, Sun Flower graph. We compute ST-chromatic number of these non perfect graphs.
{"title":"A Note on St-Coloring of Some Non Perfect Graphs","authors":"R. Moran, Aditya Pegu, I. J. Gogoi, A. Bharali","doi":"10.9734/BPI/TPMCS/V11/1498A","DOIUrl":"https://doi.org/10.9734/BPI/TPMCS/V11/1498A","url":null,"abstract":"For a graph G = (V,E) and a finite set T of positive integers containing zero, ST-coloring of a graph G is a coloring of the vertices with non negative integers such that for any two vertices of an edge, the absolute differences between the colors of the vertices does not belong to a fixed set T of non negative integers containing zero and for any two distinct edges their absolute differences between the colors of their vertices are distinct. The minimum number of colors needed for an efficient Strong T coloring of a graph is known as ST-Chromatic number. This communication is concerned with the ST-coloring of some non perfect graphs viz. Petersen graph, Double Wheel graph, Helm graph, Flower graph, Sun Flower graph. We compute ST-chromatic number of these non perfect graphs.","PeriodicalId":143004,"journal":{"name":"Theory and Practice of Mathematics and Computer Science Vol. 11","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130578316","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}
Pub Date : 2021-05-24DOI: 10.9734/bpi/tpmcs/v11/8372d
Fumio Kanbe
The present experiment investigates whether patterns of shifts of feature locations could affect the same/different decisions of simultaneously presented pairs of geometrical figures. A shift of locations was defined as the angular distance from the location of a feature in one figure to the location of the same feature in another figure. It was hypothesized that the difficulty in discriminating mirror-reflected (or axisymmetric) pairs from disoriented identical pairs was caused by complex shifting patterns inherent in axisymmetric pairs. According to the shifts of the locations of the four structural features, five pair types were prepared. They could be ordered from completely identical to completely different in their shifts: identical 0/4 pairs, non-identical 1/4 pairs, non-identical 2/4 pairs, axisymmetric 2/4 pairs and non-identical 4/4 pairs. The latencies for non-identical pairs decreased with the increase of difference in the shifts of feature locations, indicating that serial, self-terminating comparisons of the shifts were applied to the discrimination of non-identical pairs from identical pairs. However, the longer latencies in axisymmetric 2/4 pairs than in non-identical 2/4 pairs suggested that the difficulty for axisymmetric pairs was not caused by the complex shifting patterns, and the difficulty was not satisfactorily explained by the comparisons of feature locations. The latencies obtained for Nonid pairs decreased with the increase of the difference in the shifts of feature locations, indicating that serial, self-terminating comparisons of the shifts were applied to the discrimination of Nonid pairs from Id pairs.
{"title":"Investigation on the Comparisons of Feature Locations Explain the Difficulty in Discriminating Mirror-Reflected Pairs of Geometrical Figures from Disoriented Identical Pairs","authors":"Fumio Kanbe","doi":"10.9734/bpi/tpmcs/v11/8372d","DOIUrl":"https://doi.org/10.9734/bpi/tpmcs/v11/8372d","url":null,"abstract":"The present experiment investigates whether patterns of shifts of feature locations could affect the same/different decisions of simultaneously presented pairs of geometrical figures. A shift of locations was defined as the angular distance from the location of a feature in one figure to the location of the same feature in another figure. It was hypothesized that the difficulty in discriminating mirror-reflected (or axisymmetric) pairs from disoriented identical pairs was caused by complex shifting patterns inherent in axisymmetric pairs. According to the shifts of the locations of the four structural features, five pair types were prepared. They could be ordered from completely identical to completely different in their shifts: identical 0/4 pairs, non-identical 1/4 pairs, non-identical 2/4 pairs, axisymmetric 2/4 pairs and non-identical 4/4 pairs. The latencies for non-identical pairs decreased with the increase of difference in the shifts of feature locations, indicating that serial, self-terminating comparisons of the shifts were applied to the discrimination of non-identical pairs from identical pairs. However, the longer latencies in axisymmetric 2/4 pairs than in non-identical 2/4 pairs suggested that the difficulty for axisymmetric pairs was not caused by the complex shifting patterns, and the difficulty was not satisfactorily explained by the comparisons of feature locations. The latencies obtained for Nonid pairs decreased with the increase of the difference in the shifts of feature locations, indicating that serial, self-terminating comparisons of the shifts were applied to the discrimination of Nonid pairs from Id pairs.","PeriodicalId":143004,"journal":{"name":"Theory and Practice of Mathematics and Computer Science Vol. 11","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712561","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}
Pub Date : 1900-01-01DOI: 10.4172/2090-0902.1000288
Surajit Bhattacharyya
{"title":"Classical Algebra: Matrix Multiplication (The Rule of Vacancies)","authors":"Surajit Bhattacharyya","doi":"10.4172/2090-0902.1000288","DOIUrl":"https://doi.org/10.4172/2090-0902.1000288","url":null,"abstract":"","PeriodicalId":143004,"journal":{"name":"Theory and Practice of Mathematics and Computer Science Vol. 11","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132750756","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：