Results 101 to 110 of about 34,680 (295)
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
On self-clique graphs with triangular cliques
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Larrión, F. +2 more
openaire +2 more sources
Strategic Change, EarlyView.ABSTRACT The relationship between team composition and organizational outcomes is a critical topic in many managerial and business contexts. In this study, we utilize an experimental research method to examine the impact of cognitive diversity on team dynamics.
Jantunen Ari +5 more
wiley +1 more source
The Kaohsiung Journal of Medical Sciences, EarlyView.ABSTRACT Airway epithelial injury plays a critical role in the pathogenesis of chronic obstructive pulmonary disease (COPD). Mitochondrial dysfunction is implicated in this injury, while the underlying mechanism remains incompletely understood. RNA sequencing was conducted to identify key genes involved in mitochondrial dysfunction in airway epithelial
Hu Shan +9 more
wiley +1 more source
GraphZIP: a clique-based sparse graph compression method
Journal of Big Data, 2018 Massive graphs are ubiquitous and at the heart of many real-world problems and applications ranging from the World Wide Web to social networks. As a result, techniques for compressing graphs have become increasingly important and remains a challenging ...
Ryan A. Rossi, R. Zhou
semanticscholar +1 more source
Land Degradation &Development, EarlyView.ABSTRACT Legislative frameworks that support gender equality are crucial for addressing structural inequalities, protecting women's rights, and achieving gender‐equitable land degradation neutrality (LDN) outcomes. This study examines the extent to which national‐level policies and legislation governing LDN and related sectors incorporate gender ...
Cynthia Nneka Olumba +1 more
wiley +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
Oikos, EarlyView.Seed dispersal by frugivores is a central process linking plant reproduction, animal foraging, population persistence, and ecosystem resilience. Currently, the spatial template sustaining these interactions is rapidly reconfigured by habitat loss and fragmentation promoted by human activity.
Eliana Cazetta, Paulo R. Guimarães Jr
wiley +1 more source
On clique convergence of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a graph and KG be the set of all cliques of G, then the clique graph of G denoted by K(G) is the graph with vertex set KG and two elements Qi,Qj∈KG form an edge if and only if Qi∩Qj≠0̸.
S.M. Hegde, Suresh Dara
doaj +1 more source
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
AAAI Conference on Artificial Intelligence, 2016 The Maximum Weight Clique problem (MWCP) is an important generalization of the Maximum Clique problem with wide applications. This paper introduces two heuristics and develops two local search algorithms for MWCP.
Yiyuan Wang, Shaowei Cai, Minghao Yin
semanticscholar +1 more source