Titlebook: Algorithms and Discrete Applied Mathematics; First International Sumit Ganguly,Ramesh Krishnamurti Conference proceedings 2015 Springer In

永久

On Spectra of Corona GraphsLaplacian eigenvalues and signless Laplacian eigenvalues of corona graphs when the basic graph is regular. Computable expressions of eigenvalues and signless Laplacian eigenvalues are also obtained when the basic graph is a star graph.

產(chǎn)生

Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper an axiomatic characterization is obtained for the median and antimedian functions on cocktail-party graphs. In addition a characterization of the antimedian function on complete graphs is presented.

平息

古代

Domination in Some Subclasses of Bipartite Graphsose polynomial time algorithms for computing a minimum dominating set of circular-convex bipartite graphs and triad-convex bipartite graphs, by polynomially reducing the . problem for these graph classes to the . problem for convex bipartite graphs.

NIP

Conference proceedings 2015in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including app

Lumbar-Spine

0302-9743 015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms inc

BUDGE

責(zé)難

常到

,Der Vorgang einer Belastungs?nderung,t no arc of the same partite set is properly contained in the other. In this paper, we characterize proper interval bigraphs and proper circular arc bigraphs using two linear orderings of their vertex set.

迎合

Three Paths to Point Placementment graph (.), whose vertex set is .. The uniqueness requirement of the placement translates to line rigidity of the .. In this paper, we show how to construct in 2 rounds a line rigid . of size 9./7?+?.(1). This improves the best known result of 4./3?+?.(1). We also improve the lower bound on 2-round algorithms from 14./13 to 9./8.