Search Results - Classificació AMS::05 Combinatorics::05C Graph theory

Efficiency of high-order elements for continuous and discontinuous Galerkin methods by Huerta, Antonio, Angeloski, Aleksandar, Roca, Xevi, Peraire, Jaime

“…SUMMARYTo evaluate the computational performance of high‐order elements, a comparison based on operation count is proposed instead of runtime comparisons. More…”
Get full text

Centrality measure in social networks based on linear threshold model by Riquelme, Fabián, Gonzalez-Cantergiani, Pablo, Molinero, Xavier, Serna, Maria

“…Centrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the…”
Get full text

On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem by Aliste-Prieto, José, de Mier, Anna, Zamora, José

“…This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same U-polynomial (or, equivalently, the same…”
Get full text

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem by Fernández, Elena, Pozo, Miguel A., Puerto, Justo, Scozzari, Andrea

“…•Analysis of Multiobjective Spanning Tree Problems.•Different formulations of the Ordered Median Average.•Polyhedral analysis of formulations.•Extensive…”
Get full text

Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods by Blanco, Víctor, Fernández, Elena, Puerto, Justo

“…•Minimum Spanning Trees with second order cone-representable neighborhoods and lengths are studied.•Two Mixed Integer Nonlinear models are presented.•A…”
Get full text

An analogue of Vosper's theorem for extension fields by BACHOC, CHRISTINE, SERRA, ORIOL, ZÉMOR, GILLES

“…We are interested in characterising pairs S, T of F-linear subspaces in a field extension L/F such that the linear span ST of the set of products of elements…”
Get full text

The neighborhood role in the linear threshold rank on social networks by Riquelme, Fabián, Gonzalez-Cantergiani, Pablo, Molinero, Xavier, Serna, Maria

“…Centrality and influence spread are two of the most studied concepts in social network analysis. Several centrality measures, most of them, based on…”
Get full text

Quotient-polynomial graphs by Fiol, M.A.

“…As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph…”
Get full text

Bijections for Baxter families and related objects by Felsner, Stefan, Fusy, Éric, Noy, Marc, Orden, David

“…The Baxter number B n can be written as B n = ∑ k = 0 n Θ k , n − k − 1 with Θ k , ℓ = 2 ( k + 1 ) 2 ( k + 2 ) ( k + ℓ k ) ( k + ℓ + 1 k ) ( k + ℓ + 2 k ) …”
Get full text

Transformation and decomposition of clutters into matroids by Martí-Farré, Jaume, de Mier, Anna

“…A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters…”
Get full text

Power in voting rules with abstention: an axiomatization of a two components power index by Freixas, Josep, Lucchetti, Roberto

“…In order to study voting situations when voters can also abstain and the output is binary, i.e., either approval or rejection, a new extended model of voting…”
Get full text

An HDG formulation for incompressible and immiscible two-phase porous media flow problems by Costa-Solé, A., Ruiz-Gironés, E., Sarrate, J.

“…We develop a high-order hybridisable discontinuous Galerkin (HDG) formulation to solve the immiscible and incompressible two-phase flow problem in a…”
Get full text

On a Problem by Shapozenko on Johnson Graphs by Diego, Víctor, Serra, Oriol, Vena, Lluís

“…The Johnson graph J ( n ,  m ) has the m -subsets of { 1 , 2 , … , n } as vertices and two subsets are adjacent in the graph if they share m - 1 elements…”
Get full text

Enumeration of labeled 4-regular planar graphs by Noy, Marc, Requilé, Clément, Rué, Juanjo

“…In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition…”
Get full text

Some spectral and quasi-spectral characterizations of distance-regular graphs by Abiad, A., van Dam, E.R., Fiol, M.A.

“…In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph…”
Get full text

On the Diameter of Random Planar Graphs by CHAPUY, GUILLAUME, FUSY, ÉRIC, GIMÉNEZ, OMER, NOY, MARC

“…We show that the diameter diam(Gn ) of a random labelled connected planar graph with n vertices is equal to n1/4+o(1) , in probability…”
Get full text

Achievable hierarchies in voting games with abstention by Freixas, Josep, Tchantcho, Bertrand, Tedjeugang, Narcisse

“…•We focus on two main notions of influence in voting rules with abstention.•We do a study of the achievable hierarchies for these two notions of influence.•Our…”
Get full text

Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees by Gálvez-Carrillo, Imma, Kock, Joachim, Tonks, Andrew

“…We prove a Faà di Bruno formula for the Green function in the bialgebra of P-trees, for any polynomial endofunctor P. The formula appears as relative homotopy…”
Get full text

Distance mean-regular graphs by Diego, V., Fiol, M. A.

“…We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let Γ…”
Get full text

A Note on the Order of Iterated Line Digraphs by Dalfó, C., Fiol, M. A.

“…Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k‐iterated line digraph Lk(G), for k≥0, where…”
Get full text