Factorisation of Greedoid Polynomials of Rooted Digraphs

Yow, Kai Siong; Morgan, Kerri; Farr, Graham

doi:10.1007/s00373-021-02347-0

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For degree centrality, we can see that Researcher To obtain a comprehensive analysis, some other centrality measures could also be included. Since the structures and polynomials of graphs are correlated for certain classes of graphs (Yow et al, 2021), instead of focusing on centrality measures, one could examine if graph polynomials can be used in achieving the same goal.…”

Section: A Four Centrality Measuresmentioning

confidence: 99%

An Analysis on Research Collaboration Between Mathematicians in Universiti Putra Malaysia

Mohd Zu,

Yow

2024

ASMScJ

View full text Add to dashboard Cite

Social network analysis is commonly used to investigate relationships between a group of objects by modelling them using graphs. Some of its applications include network modelling and sampling, link prediction and social media analytics. In this study, we analyse research collaboration in between 44 researchers in the Department of Mathematics and Statistics, Universiti Putra Malaysia within two periods, from 2015–2017 and 2018–2020, by using social network analysis. We identify the importance of each researcher within the community by using different centrality measures such as degree, closeness, betweenness and eigenvector centralities, based on the collected data. The ten highest values in each measure for both durations are given. The graphs for each centrality measure are plotted, and a comparison on the relevant values across the two periods is made. We also discuss the relationship between each centrality measure, as well as the possible factors that affect the respective values.

show abstract

Section: A Four Centrality Measuresmentioning

confidence: 99%

An Analysis on Research Collaboration Between Mathematicians in Universiti Putra Malaysia

Mohd Zu,

Yow

2024

ASMScJ

View full text Add to dashboard Cite

show abstract

“…Note that the structure of directed graphs is usually more complex than undirected graphs, and there are several Tutte-like polynomials for directed graphs that have been defined including the greedoid polynomial [57,136], cover polynomial [28] and Tutte invariants [137,135]. Problem 4.4.…”

Section: Community Searchmentioning

confidence: 99%

Learning-Based Approaches for Graph Problems: A Survey

Yow¹,

Luo²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Over the years, many graph problems specifically those in NP-complete are studied by a wide range of researchers. Some famous examples include graph colouring, travelling salesman problem and subgraph isomorphism. Most of these problems are typically addressed by exact algorithms, approximate algorithms and heuristics. There are however some drawback for each of these methods. Recent studies have employed learning-based frameworks such as machine learning techniques in solving these problems, given that they are useful in discovering new patterns in structured data that can be represented using graphs. This research direction has successfully attracted a considerable amount of attention. In this survey, we provide a systematic review mainly on classic graph problems in which learning-based approaches have been proposed in addressing the problems. We discuss the overview of each framework, and provide analyses based on the design and performance of the framework. Some potential research questions are also suggested. Ultimately, this survey gives a clearer insight and can be used as a stepping stone to the research community in studying problems in this field.

show abstract

On properties and operations of complex neutrosophic soft groups

Rahoumah,

Yow,

Nik Long

et al. 2024

J Inequal Appl

View full text Add to dashboard Cite

Complex neutrosophic soft groups represent a significant advancement in handling uncertainty by integrating the concepts of fuzzy logic, soft sets, and neutrosophic logic. These groups generalize complex fuzzy soft groups and introduce an additional dimension through neutrosophic membership functions, namely truth, indeterminacy, and falsity. This creates a richer framework for dealing with uncertainty and ambiguity, making it well-suited for managing complex data structures in real-world applications. We explore some important definitions and theoretical frameworks surrounding complex neutrosophic soft groups, highlighting the unique aspect of neutrosophic membership functions. Additionally, we present an overview of neutrosophic soft groups, exploring some of their key operations and fundamental properties. We then examine the basics of homogeneous complex neutrosophic soft sets and their roles in establishing complex neutrosophic soft groups.

show abstract

Factorisation of Greedoid Polynomials of Rooted Digraphs

Cited by 4 publications

References 14 publications

An Analysis on Research Collaboration Between Mathematicians in Universiti Putra Malaysia

An Analysis on Research Collaboration Between Mathematicians in Universiti Putra Malaysia

Learning-Based Approaches for Graph Problems: A Survey

On properties and operations of complex neutrosophic soft groups

Contact Info

Product

Resources

About