Results 41 to 50 of about 38,382 (189)
On Edge Transitive Circulant Graphs
Tokyo Journal of Mathematics, 1996 This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire +3 more sources
Normal edge-transitive Cayley graphs of Frobenius groups [PDF]
Journal of Algebraic Combinatorics, 2015 A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the classification of normal edge-transitive Cayley graphs of order a product of two primes by dealing with Cayley graphs for ...
Corr, Brian P., Praeger, Cheryl E.
openaire +2 more sources
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Electronic Journal of Graph Theory and Applications, 2015 An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G),$ is the minimum number of da-ecards that ...
P. Anusha Devi, S. Monikandan
doaj +1 more source
SciLitMiner: An Intelligent System for Scientific Literature Mining and Knowledge Discovery
Advanced Intelligent Systems, EarlyView.SciLitMiner is an intelligent system that federately ingests scientific literature, filters it using advanced information retrieval methods, and applies retrieval‐augmented generation tailored to scientific domains. Demonstrated on creep deformation in γ‐TiAl alloys, SciLitMiner provides a controlled workflow for systematic knowledge discovery and ...
Vipul Gupta +3 more
wiley +1 more source
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
Fastest mixing Markov chain on graphs with symmetries
, 2007 We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition probability matrix).
Boyd, Stephen +3 more
core +4 more sources
Sustainable Development, EarlyView.ABSTRACT This study investigates how 14 sustainable consumption and production (SCP) factors interact across four service categories—Mass Service, Professional Service, Service Factory, and Service Shop—using interpretive structural modeling (ISM). ISM enables the identification and hierarchical classification of interdependencies among SCP factors in ...
Amanda Duarte Feitosa +4 more
wiley +1 more source
Symmetric colorings of polypolyhedra
, 2015 Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami models with one ...
Belcastro, Sarah-Marie, Hull, Thomas C.
core +1 more source
Journal of Accounting Research, EarlyView.ABSTRACT In this paper, we develop novel measures of managerial labor market classification and competition by constructing networks of compensation benchmarking peers disclosed in proxy statements. These networks represent firms’ relative positions within the managerial labor market.
RAY RUI GAO, YIFEI LU
wiley +1 more source
Methods in Ecology and Evolution, EarlyView.Abstract In group‐living animals, relationships between group members are often highly differentiated. Some dyads can maintain strong and long‐lasting relationships, while others are only connected by weak or fleeting ties. More and more studies show that aspects of social relationships are related to reproductive success and survival.
Christof Neumann, Julia Fischer
wiley +1 more source