Eulerian character degree graph

We obtain a necessary condition for the character degree graph of a solvable group G to be Eulerian.Comment: 11 page

What motivates and deters the ‘crowd’ in crowdfunding in Malaysia?

Objective: This study intends to theorize about how values and the perception of risk of the supporters of a crowdfunding project affect the success of the project. Methodology: A review of prior literature is carried out to identify the different dimensions of the decision making process. Implication: This research presents a conceptual framework to describe the influence of perceived values and risk on the success of crowdfunding in Malaysia. The crowdfunding phenomenon is relatively new in Malaysia and there is a lack of knowledge about the decision making of the ‘crowd’.  The success and sustainability of the crowdfunding phenomenon depends on the supporters of the funds

Generalized non-coprime graphs of groups

Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a and b are adjacent if and only if \gcd(|a|,|b|) \neq 1 and either a \in H or b \in H, where |a| is the order of a\in G. In this paper, we study certain graph theoretical properties of generalized non-coprime graphs of finite groups, concentrating on cyclic groups. More specifically, we obtain necessary and sufficient conditions for the generalized non-coprime graph of a cyclic group to be in the class of stars, paths, cycles, triangle-free, complete bipartite, complete, unicycle, split, claw-free, chordal or perfect graphs. Then we show that widening the class of groups to all finite nilpotent groups gives us no new graphs, but we give as an example of contrasting behaviour the class of EPPO groups (those in which all elements have prime power order). We conclude with a connection to the Gruenberg--Kegel graph

On the genus of the annhilator graph of a commutative ring

Let R be a commutative ring and Z(R)* be its set of non-zero zero-divisors. The annihilator graph of a commutative ring R is the simple undirected graph AG(R) with vertices Z(R)*, and two distinct vertices x and y are adjacent if and only if ann(xy)≠ann(x)∪ann(y). The notion of annihilator graph has been introduced and studied by A. Badawi [7]. In this paper, we determine isomorphism classes of finite commutative rings with identity whose AG(R) has genus less or equal to on

Superpower graphs of finite groups

Funding: Ajay Kumar is supported by CSIR-UGC JRF, New Delhi, India, through Ref No.: 19/06/2016(i) EU-V/Roll No. 417267. Lavanya Selvaganesh is partially supported by SERB, India, through Grant No. MTR/2018/000254 under the scheme MATRICS. T. Tamizh Chelvam is supported by CSIR Emeritus Scientist Scheme of Council of Scientific and Industrial Research (No.21(1123)/20/EMR-II), Government of India.For a finite group G, the superpower graph S(G) of G is an undirected simple graph with vertex set G and two vertices are adjacent in S(G) if and only if the order of one divides the order of the other in G. The aim of this paper is to provide tight bounds for the vertex connectivity, discuss Hamiltonian-like properties of superpower graph of finite non-abelian groups having an element of exponent order. We also give some general results about superpower graphs and their relation to other graphs such as the Gruenberg–Kegel graph.Peer reviewe

Recent developments on the power graph of finite groups - a survey

Funding: Ajay Kumar is supported by CSIR-UGC JRF, New Delhi, India, through Ref No.: 19/06/2016(i)EU-V/Roll No: 417267. Lavanya Selvaganesh is financially supported by SERB, India, through Grant No.: MTR/2018/000254 under the scheme MATRICS. T. Tamizh Chelvam is supported by CSIR Emeritus Scientist Scheme of Council of Scientific and Industrial Research (No.21 (1123)/20/EMR-II), Government of India.Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools in computer science. Conversely, graph theory has also helped to characterize certain algebraic properties of abstract algebraic structures. In this survey, we highlight the rich interplay between the two topics viz groups and power graphs from groups. In the last decade, extensive contribution has been made towards the investigation of power graphs. Our main motive is to provide a complete survey on the connectedness of power graphs and proper power graphs, the Laplacian and adjacency spectrum of power graph, isomorphism, and automorphism of power graphs, characterization of power graphs in terms of groups. Apart from the survey of results, this paper also contains some new material such as the contents of Section 2 (which describes the interesting case of the power graph of the Mathieu group M_{11}) and subsection 6.1 (where conditions are discussed for the reduced power graph to be not connected). We conclude this paper by presenting a set of open problems and conjectures on power graphs.Publisher PDFPeer reviewe

Induced subgraphs of zero-divisor graphs

Funding: Peter J. Cameron acknowledges the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no. EP/R014604/1), where he held a Simons Fellowship. For this research, T. Kavaskar was supported by the University Grant Commissions Start-Up Grant, Government of India grant No. F. 30-464/2019 (BSR) dated 27.03. T. Tamizh Chelvam was supported by CSIR Emeritus Scientist Scheme (No. 21 (1123)/20/EMR-II) of Council of Scientific and Industrial Research, Government of India.The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with a and b adjacent if ab=0. We show that the class of zero-divisor graphs is universal, in the sense that every finite graph is isomorphic to an induced subgraph of a zero-divisor graph. This remains true for various restricted classes of rings, including boolean rings, products of fields, and local rings. But in more restricted classes, the zero-divisor graphs do not form a universal family. For example, the zero-divisor graph of a local ring whose maximal ideal is principal is a threshold graph; and every threshold graph is embeddable in the zero-divisor graph of such a ring. More generally, we give necessary and sufficient conditions on a non-local ring for which its zero-divisor graph to be a threshold graph. In addition, we show that there is a countable local ring whose zero-divisor graph embeds the Rado graph , and hence every finite or countable graph, as induced subgraph. Finally, we consider embeddings in related graphs such as the 2-dimensional dot product graph.Publisher PDFPeer reviewe

Power graph of finite abelian groups

Let G be a group. The power graph ΓP(G) of G is a graph with vertex set V(ΓP(G)) = G and two distinct vertices x and y are adjacent in ΓP(G) if and only if either xˡ = y or yʲ = x, where 2 ≤ i, j ≤ n. In this paper, we obtain some fundamental characterizations of the power graph. Also, we characterize certain classes of power graphs of finite abelian groups

Properties of some ∗

ℐ-open sets were introduced and studied by Janković and Hamlett (1990) to generalize the well-known Banach category theorem. Quasi-ℐ-openness was introduced and studied by Abd El-Monsef et al. (2000). These are ∗-dense-in-itself sets of the ideal spaces. In this note, properties of these sets are further investigated and characterizations of these sets are given. Also, their relation with ℐ-dense sets and ℐ-locally closed sets is discussed. Characterizations of completely codense ideals are given in terms of semi-preopen sets

The readiness for independent living among incarcerated adolescents in Malaysia: a conceptual paper

Each year thousands of adolescents are discharged from incarceration across the nation. The Prison Department, Malaysia shows up that most of the adolescents who were released from the incarceration period infringe again and re-entered the rehabilitation centre. The increasing number of juvenile crimes and the escalating number of adolescents with repeated offences have challenged the effectiveness of existing intervention procedures and policies. By far, the intervention programs implemented at the approved school in Malaysia are mostly based on 'one for all' orientation. All inmates have to go through the same intervention process through this practice regardless of their different cases and background. Yet, little is known on how well incarcerated adolescents are equipped with relevant knowledge and skills to ensure their readiness to integrate with the outside social world upon their release from the approved schools. Given that, their readiness to cope and adapt with their lives upon their release remains elusive. Therefore, the present paper seeks to analyze the strengths and limitations of the existing intervention programs at approved schools in Malaysia. Also, factors contributing to incarcerated adolescents' readiness to reintegrate with society and to live independently, namely, coping resources of his/her needs of support, information, and feedback to delineate the challenges lying ahead, are scrutinized and proposed to improve the existing practices