Textbook Mathematics and Computing Icmc 2018 Varanasi India January 9 11 Selected Contributions Debdas Ghosh Ebook All Chapter PDF

Mathematics and Computing ICMC 2018
Varanasi India January 9 11 Selected

Contributions Debdas Ghosh
Visit to download the full and correct content document:
https://textbookfull.com/product/mathematics-and-computing-icmc-2018-varanasi-indi
a-january-9-11-selected-contributions-debdas-ghosh/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Mathematics and Computing Debdas Ghosh
https://textbookfull.com/product/mathematics-and-computing-
debdas-ghosh/
Security and Privacy Second ISEA International

Conference ISEA ISAP 2018 Jaipur India January 9 11
2019 Revised Selected Papers Sukumar Nandi
https://textbookfull.com/product/security-and-privacy-second-
isea-international-conference-isea-isap-2018-jaipur-india-
january-9-11-2019-revised-selected-papers-sukumar-nandi/
Applications of Computing and Communication

Technologies: First International Conference, ICACCT
2018, Delhi, India, March 9, 2018, Revised Selected
Papers Ganesh Chandra Deka
https://textbookfull.com/product/applications-of-computing-and-
communication-technologies-first-international-conference-
icacct-2018-delhi-india-march-9-2018-revised-selected-papers-
ganesh-chandra-deka/
Advances in Digital Forensics XVI 16th IFIP WG 11 9

International Conference New Delhi India January 6 8
2020 Revised Selected Papers Gilbert Peterson
https://textbookfull.com/product/advances-in-digital-forensics-
xvi-16th-ifip-wg-11-9-international-conference-new-delhi-india-
january-6-8-2020-revised-selected-papers-gilbert-peterson/
Communication Systems and Networks: 10th International
Conference, COMSNETS 2018, Bangalore, India, January
3-7, 2018, Extended Selected Papers Subir Biswas
https://textbookfull.com/product/communication-systems-and-
networks-10th-international-conference-comsnets-2018-bangalore-
india-january-3-7-2018-extended-selected-papers-subir-biswas/
Mathematical Analysis and Applications in Modeling

ICMAAM 2018 Kolkata India January 9 12 2020th Edition
Priti Kumar Roy (Editor)
https://textbookfull.com/product/mathematical-analysis-and-
applications-in-modeling-icmaam-2018-kolkata-india-
january-9-12-2020th-edition-priti-kumar-roy-editor/
Distributed Computing and Internet Technology 16th

International Conference ICDCIT 2020 Bhubaneswar India
January 9 12 2020 Proceedings Dang Van Hung
https://textbookfull.com/product/distributed-computing-and-
internet-technology-16th-international-conference-
icdcit-2020-bhubaneswar-india-january-9-12-2020-proceedings-dang-
van-hung/
Communication, Networks and Computing: First

International Conference, CNC 2018, Gwalior, India,
March 22-24, 2018, Revised Selected Papers Shekhar
Verma
https://textbookfull.com/product/communication-networks-and-
computing-first-international-conference-cnc-2018-gwalior-india-
march-22-24-2018-revised-selected-papers-shekhar-verma/
Communication and computing systems : proceedings of

the International Conference on Communication and
Computing Systems (ICCCS 2016), Gurgaon, India, 9-11
September, 2016 1st Edition B.M.K. Prasad
https://textbookfull.com/product/communication-and-computing-
systems-proceedings-of-the-international-conference-on-
communication-and-computing-systems-icccs-2016-gurgaon-
Springer Proceedings in Mathematics & Statistics
Debdas Ghosh · Debasis Giri

Ram N. Mohapatra · Kouichi Sakurai
Ekrem Savas · Tanmoy Som Editors
Mathematics
and
Computing
ICMC 2018, Varanasi, India, January 9–11,
Selected Contributions
Volume 253
This book series features volumes composed of selected contributions from
workshops and conferences in all areas of current research in mathematics and
statistics, including operation research and optimization. In addition to an overall
evaluation of the interest, scientific quality, and timeliness of each proposal at the
hands of the publisher, individual contributions are all refereed to the high quality
standards of leading journals in the field. Thus, this series provides the research
community with well-edited, authoritative reports on developments in the most
exciting areas of mathematical and statistical research today.
More information about this series at http://www.springer.com/series/10533

Debdas Ghosh Debasis Giri
•
Ram N. Mohapatra Kouichi Sakurai

•
Ekrem Savas Tanmoy Som

•
Editors
Mathematics and Computing

ICMC 2018, Varanasi, India, January 9–11,
Selected Contributions
123
Editors
Debdas Ghosh Kouichi Sakurai
Department of Mathematical Sciences Faculty of Information Science
Indian Institute of Technology (BHU) and Electrical Engineering
Varanasi, Uttar Pradesh, India Kyushu University
Fukuoka, Japan
Debasis Giri
Department of Computer Science Ekrem Savas
and Engineering Uşak University
Haldia Institute of Technology Uşak, Turkey
Haldia, West Bengal, India
Tanmoy Som
Ram N. Mohapatra Department of Mathematical Sciences
Department of Mathematics Indian Institute of Technology (BHU)
University of Central Florida Varanasi, Uttar Pradesh, India
Orlando, FL, USA
ISSN 2194-1009 ISSN 2194-1017 (electronic)

ISBN 978-981-13-2094-1 ISBN 978-981-13-2095-8 (eBook)
https://doi.org/10.1007/978-981-13-2095-8
Library of Congress Control Number: 2018950828
Mathematics Subject Classification (2010): 35-xx, 65-xx, 76-xx, 90-xx, 94-xx
© Springer Nature Singapore Pte Ltd. 2018

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part
of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations,
recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission
or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar
methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this
publication does not imply, even in the absence of a specific statement, that such names are exempt from
the relevant protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this
book are believed to be true and accurate at the date of publication. Neither the publisher nor the
authors or the editors give a warranty, express or implied, with respect to the material contained herein or
for any errors or omissions that may have been made. The publisher remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Dedicated to
Pandit Madan Mohan Malaviya—The
Founder of Banaras Hindu University
Preface
The Fourth International Conference on Mathematics and Computing (ICMC—

2018) was organized in the Department of Mathematical Sciences, Indian Institute
of Technology (Banaras Hindu University), Varanasi, India, during January 9–11,
2018, under the dynamic leadership of Dr. Debdas Ghosh along with the support of
Prof. R. N. Mohapatra, Prof. D. Giri, Prof. T. Som, Prof. S. Mukhopadhyay,
Prof. S. Das, Dr. A. Banerjee, and the faculty members of the Department of
Mathematical Sciences, IIT (BHU), India. There was an overwhelming response to
the program, and one hundred and twenty papers all over the country and abroad
were submitted for the consideration of presentation and later publication in the
proceedings. Taking into account the norms of the proceedings, the papers were
gone through strict blind reviewing process by at least two referees in the respective
areas and only forty-seven papers were selected for the presentation and
twenty-nine for inclusion in the Proceeding of Mathematics and Statistics, Springer.
The areas covered by the papers are the latest works in the field of cryptography,
security, abstract algebra, functional analysis, fluid dynamics, fuzzy modeling and
optimization, etc. The ICMC—2018 was attended by several experts of interna-
tional repute from the nation as well as from USA, UK, Japan, China, Finland, etc.,
as invited speakers with their high-quality research presentations. Experts were
from IIT Madras, ISI Chennai, University of Central Florida, Orlando, USA,
Kettering University, USA, University of Surrey, UK, Auburn University,
Alabama, USA, Kyushu University, Japan, Tianjin University of Science and
Technology, China, Oracle’s System of Technology, USA, University of Turku,
Finland, Haldia Institute of Technology (HIT), India, Banaras Hindu University
(BHU), India, and IIT (BHU), India. Most of the experts have submitted their
contributions for the proceeding. The Organizing Committee of ICMC—2018 is
truly thankful to all experts and paper presenters for their academic support.
Distinguished Prof. Anthony T. S. Ho of the Tianjin University, of the
University of Surrey, also of the Wuhan University of Technology has nicely
elaborated and explained the applications of Benford’s law for multimedia security
and forensics. Professor R. N. Mohapatra, University of Central Florida, has
beautifully explored the various aspects of epidemiological models with mutating
vii
viii Preface
pathogens with basic SIR model, diffusion equation, the Fisher–Kolmogoroff

equation, spatial epidemic models, and his proposed model supported with some
nice examples. Professor S. R. Chakravarty of the Kettering University elaborately
presented the different aspects of non-preemptive stochastic priority queuing model
for two different types of customers and with a new threshold. Professor K. Sakurai
of the Kyushu University has discussed non-commutative approach using ring for
enhancing the security of cryptosystems. Professor Matti Vuorinen of the
University of Turku gave insightful elaboration on computation of condenser
capacity. Dr. Srinivas Pyda of Oracle’s System of Technology has discussed well
the mathematics in machine learning. Professor Dr. Parisa Hariri of the University
of Turku has explored the hyperbolic metric of plane domain to a subdomain of Rn
(n 2), discussed the geometry and topology of metric balls, and compared
different hyperbolic type metrics and gave an application to solve Ptolemy–Alhazen
problem. Professor S. Ponnusamy of IIT Madras has described the classical Bohr’s
theorem for bounded functions, bounded n-symmetric functions, half-plane map-
pings, half-plane n-symmetric mappings, and added some nice examples supporting
the theory; Prof. Debasis Giri of HIT has elaborated on authenticated encryption of
long messages; Prof. Chris Rodger of the Auburn University has explored the
various aspects of graph embedding and construction of Hamilton’s decomposition
of graphs and elaborated with nice examples having several applications.
Professor S. K. Mishra of BHU talked about the properties and relations of strong
pseudomonotone and strong quasimonotone operators. Professor T. Som of IIT
(BHU) has contributed to convergence of generalized Mann type of iterates to
common fixed point though he has dealt with soft relation and fuzzy soft relation
with application to decision-making problems in the conference program. The
submitted contributions of the experts are included in the proceeding. The orga-
nizing committee is truly thankful to all the experts for their valuable contribution to
the conference.
I, on behalf of the organizing committee, gratefully acknowledge the financial
support to the conference by
– Science and Engineering Research Board, India
– Defence Research and Development Organization, India
– Indian Institute of Technology (BHU), India
– Council of Research and Industrial Research, India
– SCUBE India.
Varanasi, India Prof. Tanmoy Som

Organizing Secretary
Contents
1 Constructions and Embeddings of Hamilton Decompositions

of Families of Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
C. A. Rodger
2 On Strong Pseudomonotone and Strong
Quasimonotone Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
Sanjeev Kumar Singh, Avanish Shahi and S. K. Mishra
3 A Dynamic Non-preemptive Priority Queueing Model
with Two Types of Customers . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
Srinivas R. Chakravarthy
4 Ih -Statistical Convergence of Weight g in Topological Groups . . . . 43
Ekrem Savas
5 On the Integral-Balance Solvability of the Nonlinear Mullins
Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
Jordan Hristov
6 Optimal Control of Rigidity Parameter of Elastic Inclusions
in Composite Plate with a Crack . . . . . . . . . . . . . . . . . . . . . . . . . . 67
Nyurgun Lazarev and Natalia Neustroeva
7 Convergence of Generalized Mann Type of Iterates to Common
Fixed Point . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
T. Som, Amalendu Choudhury, D. R. Sahu and Ajeet Kumar
8 Geometric Degree Reduction of Bézier Curves . . . . . . . . . . . . . . . . 87
Abedallah Rababah and Salisu Ibrahim
9 Cybersecurity: A Survey of Vulnerability Analysis and Attack
Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
Rachid Ait Maalem Lahcen, Ram Mohapatra and Manish Kumar
ix
x Contents
10 A Solid Transportation Problem with Additional Constraints

Using Gaussian Type-2 Fuzzy Environments . . . . . . . . . . . . . . . . . 113
Sharmistha Halder (Jana), Debasis Giri, Barun Das,
Goutam Panigrahi, Biswapati Jana and Manoranjan Maiti
11 Complements to Voronovskaya’s Formula . . . . . . . . . . . . . . . . . . . 127
Margareta Heilmann, Fadel Nasaireh and Ioan Raşa
12 Mathematics and Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . 135
Srinivas Pyda and Srinivas Kareenhalli
13 Numerical Study on the Influence of Diffused Soft Layer in pH
Regulated Polyelectrolyte-Coated Nanopore . . . . . . . . . . . . . . . . . . 155
Subrata Bera, S. Bhattacharyya and H. Ohshima
14 Quadruple Fixed Point Theorem for Partially Ordered Metric
Space with Application to Integral Equations . . . . . . . . . . . . . . . . . 169
Manjusha P. Gandhi and Anushri A. Aserkar
15 Enhanced Prediction for Piezophilic Protein by Incorporating
Reduced Set of Amino Acids Using Fuzzy-Rough Feature
Selection Technique Followed by SMOTE . . . . . . . . . . . . . . . . . . . 185
Anoop Kumar Tiwari, Shivam Shreevastava, Karthikeyan Subbiah
and Tanmoy Som
16 Effect of Upper and Lower Moving Wall on Mixed Convection
of Cu-Water Nanofluid in a Square Enclosure with Non-uniform
Heating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
S. K. Pal and S. Bhattacharyya
17 On Love Wave Frequency Under the Influence of Linearly
Varying Shear Moduli, Initial Stress, and Density of Orthotropic
Half-Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
Sumit Kumar Vishwakarma, Tapas Ranjan Panigrahi
and Rupinderjit Kaur
18 The Problem of Oblique Scattering by a Thin Vertical
Submerged Plate in Deep Water Revisited . . . . . . . . . . . . . . . . . . . 225
B. C. Das, S. De and B. N. Mandal
19 A Note on Necessary Condition for Lp Multipliers with Power
Weights . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
Rajib Haloi
20 On M=Gða;bÞ =1=N Queue with Batch Size- and Queue
Length-Dependent Service . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
G. K. Gupta and A. Banerjee
Contents xi
21 A Fuzzy Random Continuous (Q, r, L) Inventory Model

Involving Controllable Back-order Rate and Variable Lead-Time
with Imprecise Chance Constraint . . . . . . . . . . . . . . . . . . . . . . . . . 263
Debjani Chakraborty, Sushil Kumar Bhuiya and Debdas Ghosh
22 Estimation of the Location Parameter of a General Half-Normal
Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
Lakshmi Kanta Patra, Somesh Kumar and Nitin Gupta
23 Existence of Equilibrium Solution of the Coagulation–
Fragmentation Equation with Linear Fragmentation Kernel . . . . . 295
Debdulal Ghosh and Jitendra Kumar
24 Explicit Criteria for Stability of Two-Dimensional Fractional
Nabla Difference Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
Jagan Mohan Jonnalagadda
25 Discrete Legendre Collocation Methods for Fredholm–
Hammerstein Integral Equations with Weakly
Singular Kernel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 315
Bijaya Laxmi Panigrahi
26 Norm Inequalities Involving Upper Bounds for Operators
in Orlicz-Taylor Sequence Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . 329
Atanu Manna
27 A Study on Fuzzy Triangle and Fuzzy
Trigonometric Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341
Debdas Ghosh and Debjani Chakraborty
28 An Extension Asymptotically ‚-Statistical Equivalent
Sequences via Ideals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361
Ekrem Savas and Rabia Savas
29 Fuzzy Goal Programming Approach for Resource Allocation
in an NGO Operation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
Vinaytosh Mishra, Tanmoy Som, Cherian Samuel and S. K. Sharma
30 Stoichio Simulation of FACSP From Graph Transformations
to Differential Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387
J. Philomenal Karoline, P. Helen Chandra, S. M. Saroja Theerdus
Kalavathy and A. Mary Imelda Jayaseeli
31 Fully Dynamic Group Signature Scheme with Member
Registration and Verifier-Local Revocation . . . . . . . . . . . . . . . . . . 399
Maharage Nisansala Sevwandi Perera and Takeshi Koshiba
32 Fourier-Based Function Secret Sharing with General Access
Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 417
Takeshi Koshiba
xii Contents
33 A Uniformly Convergent NIPG Method for a Singularly

Perturbed System of Reaction–Diffusion Boundary-Value
Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 429
Gautam Singh and Srinivasan Natesan
34 On Solving Bimatrix Games with Triangular Fuzzy Payoffs . . . . . . 441
Subrato Chakravorty and Debdas Ghosh
35 Comparison of Two Methods Based on Daubechies Scale
Functions and Legendre Multiwavelets for Approximate Solution
of Cauchy-Type Singular Integral Equation on R . . . . . . . . . . . . . . 453
Swaraj Paul and B. N. Mandal
Contributors
Rachid Ait Maalem Lahcen Department of Mathematics, University of Central

Florida, Orlando, FL, USA
Anushri A. Aserkar Department of Mathematics, Rajiv Gandhi College of
Engineering and Research, Nagpur, India
A. Banerjee Department of Mathematical Sciences, Indian Institute of Technology
(BHU), Varanasi, Uttar Pradesh, India
Subrata Bera Department of Mathematics, National Institute of Technology
Silchar, Silchar, India
S. Bhattacharyya Department of Mathematics, Indian Institute of Technology
Kharagpur, Kharagpur, West Bengal, India
Sushil Kumar Bhuiya Department of Mathematics, Indian Institute of
Technology Kharagpur, Kharagpur, West Bengal, India
Debjani Chakraborty Department of Mathematics, Indian Institute of
Technology Kharagpur, Kharagpur, West Bengal, India
Srinivas R. Chakravarthy Departments of Industrial and Manufacturing
Engineering and Mathematics, Kettering University, Flint, MI, USA
Subrato Chakravorty Department of Mechanical Engineering, Indian Institute of
Technology (BHU), Varanasi, Uttar Pradesh, India
Amalendu Choudhury Department of Mathematics and Statistics, Haflong
Government College, Haflong, Dima Hasao, Assam, India
B. C. Das Department of Applied Mathematics, Calcutta University, Kolkata,
India
Barun Das Department of Mathematics, Sidho Kanho Birsha University, Purulia,
West Bengal, India
S. De Department of Applied Mathematics, Calcutta University, Kolkata, India
xiii
xiv Contributors
Manjusha P. Gandhi Department of Mathematics, Yeshwantrao Chavan College

of Engineering, Nagpur, India
Debdas Ghosh Department of Mathematical Sciences, Indian Institute of
Debdulal Ghosh Department of Mathematics, Indian Institute of Technology
Debasis Giri Department of Computer Science and Engineering, Haldia Institute
of Technology, Haldia, East Midnapore, India
G. K. Gupta Department of Mathematical Sciences, Indian Institute of
Nitin Gupta Indian Institute of Technology Kharagpur, Kharagpur, West Bengal,
India
Sharmistha Halder (Jana) Department of Mathematics, Midnapore College
[Autonomous], Midnapore, India
Rajib Haloi Department of Mathematical Sciences, Tezpur University, Tezpur,
Sonitpur, Assam, India
Margareta Heilmann School of Mathematics and Natural Sciences, University of
Wuppertal, Wuppertal, Germany
P. Helen Chandra Jayaraj Annapackiam College for Women (Autonomous),
Theni, Tamil Nadu, India
Jordan Hristov Department of Chemical Engineering, University of Chemical
Technology and Metallurgy (UCTM), Sofia, Bulgaria
Salisu Ibrahim Department of Mathematics Northwest University, Kano, Nigeria
Biswapati Jana Department of Computer Science, Vidyasagar University,
Midnapore, West Bengal, India
Jagan Mohan Jonnalagadda Department of Mathematics, Birla Institute of
Technology and Science, Pilani, Hyderabad, Telangana, India
Srinivas Kareenhalli Oracle India, Bengaluru, India
Rupinderjit Kaur Department of Mathematics, Birla Institute of Technology and
Science, Pilani, Hyderabad, India
Takeshi Koshiba Faculty of Education and Integrated Arts and Sciences, Waseda
University, Shinjuku-ku, Tokyo, Japan
Ajeet Kumar Department of Mathematics, Banaras Hindu University, Varanasi,
India
Jitendra Kumar Department of Mathematics, Indian Institute of Technology
Contributors xv
Manish Kumar Department of Mathematics, Birla Institute of Technology and

Science-Pilani, Hyderabad, Telangana, India
Somesh Kumar Indian Institute of Technology Kharagpur, Kharagpur, West
Bengal, India
Nyurgun Lazarev North-Eastern Federal University, Yakutsk, Russia;
Lavrentyev Institute of Hydrodynamics SB RAS, Novosibirsk, Russia
Manoranjan Maiti Department of Applied Mathematics with Oceanology and
Computer Programming, Vidyasagar University, Midnapore, West Bengal, India
B. N. Mandal Physics and Applied Mathematics Unit, Indian Statistical Institute,
Kolkata, India
Atanu Manna Faculty of Mathematics, Indian Institute of Carpet Technology,
Bhadohi, Uttar Pradesh, India
A. Mary Imelda Jayaseeli Jayaraj Annapackiam College for Women
(Autonomous), Theni, Tamil Nadu, India
S. K. Mishra Department of Mathematics, Institute of Science, Banaras Hindu
University, Varanasi, India
Vinaytosh Mishra Indian Institute of Technology (BHU), Varanasi, India
Ram Mohapatra Department of Mathematics, University of Central Florida,
Orlando, FL, USA
Fadel Nasaireh Department of Mathematics, Technical University, Cluj-Napoca,
Romania
Srinivasan Natesan Department of Mathematics, Indian Institute of Technology
Guwahati, Guwahati, India
Natalia Neustroeva North-Eastern Federal University, Yakutsk, Russia
H. Ohshima Faculty of Pharmaceutical Sciences, Tokyo University of Science,
Noda, Chiba, Japan
S. K. Pal Department of Mathematics, Indian Institute of Technology Kharagpur,
Kharagpur, West Bengal, India
Bijaya Laxmi Panigrahi Department of Mathematics, Sambalpur University,
Sambalpur, Odisha, India
Goutam Panigrahi Department of Mathematics, National Institute of Technology,
Durgapur, West Bengal, India
Tapas Ranjan Panigrahi Department of Mathematics, Birla Institute of
Technology and Science, Pilani, Hyderabad, India
Lakshmi Kanta Patra Indian Institute of Information Technology Ranchi,
Ranchi, India
xvi Contributors
Swaraj Paul Department of Mathematics, Visva Bharati, Santiniketan, West

Bengal, India
Maharage Nisansala Sevwandi Perera Graduate School of Science and
Engineering, Saitama University, Saitama, Japan
J. Philomenal Karoline Jayaraj Annapackiam College for Women (Autonomous),
Theni, Tamil Nadu, India
Srinivas Pyda Oracle America, Redwood Shores, CA, USA
Abedallah Rababah Department of Mathematical Sciences, United Arab
Emirates University, Al Ain, UAE
Ioan Raşa Department of Mathematics, Technical University, Cluj-Napoca,
Romania
C. A. Rodger Department of Mathematics and Statistics, Auburn University,
Baltimore, AL, USA
D. R. Sahu Department of Mathematics, Banaras Hindu University, Varanasi,
India
Cherian Samuel Indian Institute of Technology (BHU), Varanasi, India
S. M. Saroja Theerdus Kalavathy Jayaraj Annapackiam College for Women
(Autonomous), Theni, Tamil Nadu, India
Ekrem Savas Department of Mathematics, Usak University, Usak, Turkey
Rabia Savas Department of Mathematics, Sakarya University, Sakarya, Turkey
Avanish Shahi Department of Mathematics, Institute of Science, Banaras Hindu
University, Varanasi, India
S. K. Sharma Indian Institute of Technology (BHU), Varanasi, India
Shivam Shreevastava Department of Mathematical Sciences, Indian Institute of
Technology (BHU), Varanasi, India
Gautam Singh Department of Mathematics, Indian Institute of Technology
Guwahati, Guwahati, India
Sanjeev Kumar Singh Department of Mathematics, Institute of Science, Banaras
Hindu University, Varanasi, India
T. Som Department of Mathematical Sciences, Indian Institute of Technology
(BHU), Varanasi, India
Tanmoy Som Department of Mathematical Sciences, Indian Institute of
Technology (BHU), Varanasi, India
Contributors xvii
Karthikeyan Subbiah Department of Computer Science, Institute of Science

Anoop Kumar Tiwari Department of Computer Science, Institute of Science
Sumit Kumar Vishwakarma Department of Mathematics, Birla Institute of
Technology and Science, Pilani, Hyderabad, India
Chapter 1
Constructions and Embeddings
of Hamilton Decompositions
of Families of Graphs
C. A. Rodger
Abstract In this paper, a discussion of the use of amalgamations in constructing

Hamilton decompositions of graphs is presented. Edge-colorings that are fair in var-
ious senses are critical to this endeavor, so some discussion of them is also included.
Finally, the power of amalgamations is demonstrated in the overview of results in the
literature that take a given edge-coloring of a graph and extend it to one of a family
of graphs (e.g., a complete graph or a complete multipartite graph) in which each
color class is a Hamilton cycle.
Keywords Hamilton cycles · Amalgamations · Fair edge-colorings · Embeddings
1 Introduction
Colorings of graphs are very useful in a variety of settings, especially scheduling

problems. In such problems, sharing objects (vertices or edges) out evenly in various
ways usually has beneficial effects in the application being considered. For example,
the most basic of these fairness notions is to ensure that the coloring is proper (no
two adjacent objects receive the same color). But other notions also play a vital role.
One could ask for the coloring to be equalized; that is, the number of objects of
each color is within one of the number of objects of each other color. Two examples
illustrate this.
The first example is the scheduling problem where various companies send rep-
resentatives to a central location, such as Chicago Airport, where they are to meet
other companies for one-on-one discussions. All representatives are in the same in-
dustry so, while not every pair of companies’ representatives need to meet, there is
a lot of congestion to manage. The aim is to schedule the meetings (each is to last
30 min) to minimize the number of time slots needed to satisfy all needs to meet.
The number of rooms is also an issue, partly due to availability and partly due to
C. A. Rodger (B)
Department of Mathematics and Statistics, Auburn University,
221 Parker Hall, Baltimore, AL 36849-5310, USA
e-mail: rodgec1@auburn.edu
© Springer Nature Singapore Pte Ltd. 2018 1

D. Ghosh et al. (eds.), Mathematics and Computing, Springer Proceedings
in Mathematics & Statistics 253, https://doi.org/10.1007/978-981-13-2095-8_1
2 C. A. Rodger
expense. This problem can be modeled by a graph G formed by letting each company
(representative) be represented by a vertex, two vertices being joined if and only if
the corresponding companies need to meet. A proper edge-coloring with k colors
provides a schedule using k time slots: Representatives i and j meet at time slot k if
the edge {i, j} is colored k. Clearly the fact that the edge-coloring is proper ensures
that each representative is scheduled to meet at most one other representative at each
time. The number of rooms needed is decided by the size of the biggest color class,
and this is minimized if the edge-coloring is also equalized. Results in the litera-
ture come close to immediately answering this problem: k can be any value at least
χ (G), which by Vizing’s Theorem is either the maximum degree = (G) of G,
or is + 1, and a result by McDiarmid [1] guarantees that if there exists a proper
k-edge-coloring, then there exists an equalized proper k-edge-coloring. Deciding if
a schedule with timeslots is possible may be difficult to determine, as this falls
in the class of NP-complete problems; but rather than working hard to save just one
time period, simply using + 1 timeslots often may not be a problem.
The second example contrasts with the first quite nicely. Various university clubs
are to meet one evening to plan their efforts to help Auburn collect enough food to win
the Auburn-Alabama Food Fight, designed to help the hungry in Alabama. Ideally,
each club would only meet if all its representatives attending that evening are able to
be present at the meeting. Again the plan is to schedule the meetings (each is to last
30 min) in a way that minimizes the number of time slots needed for each club to
meet, having all members present; as before, the number of rooms is also an issue. In
this case, the model is a graph in which each club is represented by a vertex and two
vertices are joined by an edge if the corresponding clubs have a member in common.
So a proper vertex-coloring with k colors provides a schedule using k time slots:
Club i meets at time slot k if vertex i is colored k. The fact that the vertex-coloring is
proper ensures that clubs with members in common are scheduled at different times.
Minimizing the number of rooms needed again calls for an equalized vertex-coloring
(often called an equitable vertex-coloring in the literature). Unfortunately, results in
the literature have more trouble solving this problem; both answering the question
of how many colors are needed (χ(G) is not easily determined) and of whether or
not an equalized vertex-coloring exists. The number of time slots can be any value
at least χ(G); if it is chosen to be more than (G), then it is known that the vertex-
coloring can be equalized ([2]). Other efforts over the past 40 years to find conditions
guaranteeing the existence of equalized vertex-colorings have been found, but much
work remains to understand this property.
Many interesting problems associated with fair colorings of various sorts remain
open and are of practical use. Several more will be introduced later in the paper as
they are needed.
A third practical problem addressed by graph theory is the famous traveling sales-
man problem. A salesman has to visit a predetermined set of cities, one by one, then
return home, following a route that minimizes the distance travelled. It is modeled by
a graph, G, in which the vertices represent the cities, edges represent various routes to
get from city to city, and all edges are weighted by the distance of the corresponding
route. In the unworldy case where all the edges have weight 1, this problem asks
1 Constructions and Embeddings of Hamilton Decompositions … 3
whether or not G contains a Hamilton cycle (a cycle in G which includes each vertex
in V (G)). This too falls into the family of NP-complete problems, so is difficult to
solve, even in this seemingly far simpler situation. Related to the Hamiltonicity of a
graph is a stronger property. A Hamilton decomposition of G is a partition of E(G),
each element of which induces a Hamilton cycle. Since each Hamilton cycle includes
exactly two edges incident with each vertex, clearly G needs to be regular in order
to have a Hamilton decomposition. Around 125 years ago, Walecki proved that the
complete graph K n has a Hamiltonian decomposition if and only if n is odd [3].
This too has an interpretation in an applied setting, related to the traveling salesman
problem. In this case, the salesman wants to visit certain important cities on every
trip, but other towns along the way can be visited less often. The Hamilton cycles in a
Hamilton decomposition ensure that each time out the salesman visits the important
cities (the vertices of the graph), and then since each edge is in exactly one Hamilton
cycle, towns along the roads corresponding to the edges will be visited as the road
is traversed.
For each of these three problems, interest eventually turned from complete graphs
to another natural family of graphs, namely the complete multipartite graphs: The
vertices in each such graph are partitioned into p parts, with two vertices being joined
by an edge if and only if they are in different parts. The chromatic index of such graphs
was settled thirty years ago [4], and the value of the chromatic number is obvious,
but finding equalized vertex-colorings is not so straightforward (see [5]). For such
graphs to have a Hamilton decomposition, clearly they must be regular; to be regular,
clearly all parts must have the same size. So this motivates the following definition:
Let K (n, p) denote the complete multipartite graph with p parts in which each part
contains n vertices. Deciding whether or not K (n, p) has a Hamilton decomposition
was settled by Laskar and Auerbach [6] 40 years ago, showing that it exists if and
only if n( p − 1) is even.
Much more recently, a third family of graphs has drawn wide interest, motivated
by the construction of experimental designs in statistics. A block design with two
association classes (BDTAC) can be described graph theoretically as follows. Let
K (P, λ1 , λ2 ) be the graph in which P is a partition of the vertices, two vertices being
joined by λ1 edges if they are in the same part of P and by λ2 edges if they are in
different parts. The BDTAC is equivalent to a partition of the edges of K (P, λ1 , λ2 ),
each element of which is a copy of K k for some integer k. In the setting of this
paper, the natural question is whether or not there exists a Hamilton decomposition
of K (P, λ1 , λ2 ), so of particular interest is the regular graph K (n, p, λ1 , λ2 ) where
each of the p parts in K (P, λ1 , λ2 ) contains n vertices. This problem was settled
by Bahmanian and Rodger 5 years ago [7]. Their method of proof is the main topic
in Sect. 2. Continuing the theme of fairness in colorings, the amalgamation proof
technique produces a graph H from a given edge-colored graph G, where G is a
graph homomorphism of H , such that the edges in H are shared out among the
vertices and among color classes in ways that are fair with respect to several notions
of balance. The connectivity of color classes is also addressed.
In Sect. 3, the embedding of edge-colored graphs into edge-colored copies of
K (n, p, λ1 , λ2 ) is the main focus. This is a great demonstration of the power of
4 C. A. Rodger
amalgamation proofs, but is also motivated by applications in the following sense.

Scheduling problems often require prerequisite conditions to be built into the final
schedule. For example, when deciding which teachers should teach which classes at
what times, some teachers may not be able to teach early in the morning. Hilton [8]
developed the notion of an outline schedule where times are compressed into a small
number of groups; say early morning, late morning, early afternoon, and last classes.
Similarly, subjects being taught, or classes for the same age students could also form
such groups. Once this outline schedule has been developed, reversing the amalga-
mation approach develops the full schedule. This method also allows prerequisites
to be built into about a quarter of the entire schedule. Here, we begin with a given
edge-colored copy of K (n, p1 , λ1 , λ2 ) and embed it in a copy of K (n, p2 , λ1 , λ2 )
such that each color class induces a Hamilton cycle. In view of the third problem
described above, the given copy can be thought of as the given prerequisites in the
final Hamilton decomposition that realizes the schedule of the salesman.
2 Amalgamations and Hamilton Decompositions
In 1984, Hilton [9] made a leap forward in the study of Hamilton decompositions.
He had the idea of starting with a single vertex, say α, incident with n(n − 1)/2
loops, n of each of (n − 1)/2 colors, and attempted to disentangle n vertices from
α, one at a time, to end up with the complete graph K n in which each color class
was a Hamilton cycle. The proof was inductive, so was especially powerful in that it
allowed one to start midway through the process rather than with a single vertex. All
that was needed was for this midway point to satisfy the conditions described in the
inductive hypotheses, conditions which actually turn out to be necessary anyway.
It is helpful to think of the single vertex as originally containing the n vertices
that eventually appear in the final graph. As each vertex is disentangled from α,
one less vertex is still contained in it, so at the ith step one can naturally define
the amalgamation function f i (α) = n − i to be the number of vertices still in α.
Inductively, the setup at the ith step is to have: f i (α)( f i (α) − 1)/2 loops incident
with α; one edge between each pair of disentangled vertices; and n − f i (α) edges
between each disentangled vertex and α. Since we hope to end up with K n then at the
ith step, one end of each of f i (α) − 1 loops is detached from α and joined instead of
the new vertex being disentangled from α. Also, from each previously disentangled
vertex, one of the n − f i (α) edges joining it to α is detached from α, its new end
becoming the disentangled vertex instead of α. So, with these properties in mind, by
the time the (n − 1)th step is completed, it is easy to see our single vertex with loops
has been transformed into K n .
Advantageously, the method is even more flexible than described so far in that
it is possible to start with a graph G having p vertices, each vertex, v, containing
f (v) = n vertices (or even setups more general than that). If each of the p vertices,
v, has λ1 f (v)( f (v) − 1)/2 = λ1 n(n − 1)/2 loops on it, and if between each pair of
the p vertices, say u and v, there are λ2 f (u) f (v) = λ2 n 2 edges, then this graph is
the amalgamation (homomorphic image) of H = K (n, p, λ1 , λ2 ): For each of the

p parts of K (n, p, λ1 , λ2 ), amalgamate the n vertices into a single vertex to form
G. Notice that this includes the classical complete multipartite graphs, when λ1 = 0
and λ2 = 1.
Of course, the point here is not just to produce K n or K (n, p, λ1 , λ2 ); we are
really trying to produce Hamilton decompositions (or other graph decompositions)
of these graphs. The idea is that if the disentangling process can be achieved, then
it is much easier to form the amalgamated graph with a suitable edge-coloring (an
outline of the final decomposition) than it is to find the final decomposition directly.
So attention also needs to be paid to the color of the edges being selected during
the disentangling process, both the loops incident with α and the edges joining the
previously disentangled vertices to α. It turns out that we now have a lot of control over
the disentanglement. Various results appear in the literature, but the following result
is a good example of what is possible. Proved in more generality by Bahmanian and
Rodger in [7], it ties in nicely with the fairness notions described earlier. Informally, it
says that if D(v) is the set of vertices in H disentangled from v in G, then each vertex
u in D(v) receives its fair share of the edge ends in G incident with v, and each vertex
u in D(v) receives its fair share of the edge ends in G incident with v colored j. That
is, d H (v) ∈ {dG (v)/n, dG (v)/n} and d H ( j) (v) ∈ {dG( j) (v)/n, dG( j) (v)/n},
where G( j) is the subgraph of G induced by the edges colored j. In Theorem 1,
ψ plays the role of the amalgamation function, G (u) is the number of loops in G
incident with u, and m G (u, v) is the number of edges in G joining u to v.
Theorem 1 [7] Let G be a k-edge-colored graph and let ψ be a function from V (G)
into the positive integers such that for each u ∈ V (G),
(1) ψ(u) = 1 implies G (u) = 0,
(2) dG( j) (u)/ψ(u) is an even integer for all 1 ≤ j ≤ k,
ψ(u)
(3) 2
divides G (u),
(4) ψ(u)ψ(v) divides m G (u, v) for each v ∈ V (G) \ {u}, and
(5) G( j) is connected for 1 ≤ j ≤ k.
Then, there exists a detachment H of G in which each u ∈ V (G) is disentangled
into vertices u 1 , . . . , u ψ(u) , such that for all u ∈ G:

(i) m H (u i , u i ) = G (u)/ ψ(u)2
for all 1 ≤ i < i ≤ ψ(u) if ψ(u) ≥ 2,
(ii) m H (u i , vi ) = m G (u, v)/ψ(u)ψ(v) for v ∈ V (G) \ {u}, 1 ≤ i ≤ ψ(u), and 1 ≤
i ≤ ψ(v),
(iii) d H ( j) (u i ) = d H ( j) (u)/ψ(u) for 1 ≤ i ≤ ψ(u) and 1 ≤ j ≤ k, and
(iv) Each color class H ( j) is connected for 1 ≤ j ≤ k.
Condition (2) is critical for proving that connected color classes in G can remain
connected during the disentangling process, thus guaranteeing that condition (iv) is
satisfied by H . Since we aim to have each color class disentangled into a Hamilton cy-
cle, clearly each vertex v in the amalgamated graph we construct needs to be incident
with 2ψ(v) edges colored j, for each color j, since each of the ψ(v) vertices inside
v needs to be incident with exactly two edges colored j in the disentangled graph.
6 C. A. Rodger
Not only does this approach give a new proof of Walecki’s [3] result, but it also
lends itself beautifully to other families of graphs than complete graphs.
Theorem 2 [6, 10] There exists a Hamilton decomposition of λK (n, p) if and only
if λn( p − 1) is even.
To see how Theorem 1 is of use in proving Theorem 2, start with p vertices, each
joined to each other with λn 2 edges. The edges are then colored with λn( p − 1)/2
colors so that each color class is connected and 2n-regular (the details of how the
edge-coloring is accomplished are not included here, but one natural approach is to
add Hamilton cycles of K p , each containing edges of just one color, to complete
most of the task). It is easy to see that this edge-colored graph satisfies conditions
(1–5) of Theorem 1 with ψ(v) = n for all vertices. So the disentangled graph, H :
by condition (ii) H is simple, so it must be that H = λK (n, p); by conditions (iii–
iv), each color class of H is 2-regular and connected, so is a Hamilton cycle. This
completes the proof.
More recently, the existence of Hamilton decompositions of K (n, p, λ1 , λ2 ) was
completely settled in the following theorem.
Theorem 3 [7] Let p > 1, λ1 ≥ 0, and λ2 ≥ 1, with λ1 = λ2 be integers. Then,
there exists a Hamilton decomposition of K (n, p, λ1 , λ2 ) if and only if
(ii) λ1 (n − 1) + λ2 n( p − 1) is even, and
(iii) λ1 ≤ λ2 n( p − 1).
It is hopefully not surprising now that the proof of the sufficiency follows the
above approaches closely, starting with p vertices, each joined to each other with
λn 2 edges, but this time each vertex is also incident with λ1 n(n − 1)/2 loops. The
edges are then colored so that each color class is connected and 2n-regular. Once
this is done, the result follows essentially immediately from Theorem 1.
The proof of the necessity of Theorem 3 is not included here, but it is worth giving
some feel for why condition (iii) is necessary. First note that every Hamilton cycle
in K (n, p, λ1 , λ2 ) must use at least p edges joining vertices in different parts in
order to be connected. So if we allow λ1 to grow while holding all other parameters
constant, we will eventually run out of the edges joining vertices in different parts.
For this reason, an upper bound on λ1 is to be expected.
3 Embeddings of Edge-Colorings into Hamilton

Decompositions
The embedding interest followed the same line as the construction results described in
Sect. 2: First studied was embeddings of edge-colored graphs into Hamilton decom-
positions of K n (see Theorem 4), then of complete multipartite graphs (see Theorem
5), and then of K (n, p, λ1 , λ2 ) (see Theorems 6 and 7). We now survey this progress,
one by one.
In the previous section, Hilton’s paper [9] introducing amalgamations as a means

of producing graph decompositions was described. One of the great applications he
developed was the idea of building prerequisites into the final Hamilton decomposi-
tion. In his paper, he proved the following result which completely describes when
it is possible to start with a given edge-coloring of K n and embed it in a Hamilton
decomposition of K m ; that is, add m − n new vertices to the given edge-colored K n ,
and edges to form a K m , then color all the added edges so that each color class is
a Hamilton cycle. This was truly an amazing result, since typically the given edge-
coloring would seemingly need to have much postulated structure or symmetry to
make such a result provable. But the amalgamation method is so flexible that he
completely solved the problem with the following result.
Theorem 4 [9] A k-edge-colored K n (some colors may appear on no edges) can

be embedded into a Hamiltonian decomposition of K m if and only if
1. m is odd,
2. k = m/2, and
3. Each color class of the given edge-coloring of K n has at most m − n components,
each of which is a path (isolated vertices are considered to be paths of length 0).
Proof The necessity of these conditions is quite clear: (1–2) follow since in K m each
vertex is incident with exactly two edges of each color; (3) follows because each
one of the m − n added vertices can be used to connect just two components in each
color class.
Proving the sufficiency clearly demonstrates the power of amalgamations. At first
sight, it is not clear at all how to color all the added edges. But we immediately know
how to color them in the graph formed by taking any solution to the embedding and
amalgamating the added vertices to form a single vertex (in the notation of Sect. 2,
the amalgamated vertex is like α, with f (α) = m − n). The following shows how
to form the amalgamated graph G, even though we do not have a solution (i.e., a
Hamilton decomposition of H = K m ) in hand.
1. Join each vertex in K n to the added vertex α with m − n edges.
2. Color the added edges so that each vertex in K n has degree 2 in each color class.
(This is possible since then vertices in K n would have degree 2k = (n − 1) +
(m − n).)
3. Add (m − 1)(m − n − 1)/2 loops incident with α.
4. To complete the edge-coloring of G, color the loops so that α is incident with
exactly 2(m − n) edge ends of each color; each loop contributes two edge ends.
(This is possible since condition (3) guarantees the number of loops to be added
is nonnegative and the number of edges of each color added in the second step is
even.)
We can now immediately form a Hamilton decomposition of H from G using The-
orem 1 with ψ(u) = 1 for all vertices in K n and ψ(α) = m − n. To see this, refer to
the various parts of Theorem 1 in turn as follows.
8 C. A. Rodger
(i) Shows that once the m − n vertices in α are disentangled, the ((m − n)(m −
n − 1)/2 loops on α induce a simple graph, which must be K m−n .
(ii) Shows that once the m − n vertices in α are disentangled, the m − n edges
joining each vertex u in K n to α become single edges joining u to each of the
m − n disentangled vertices. So at this stage we know that H is K m .
(iii) Shows that each vertex in H has degree 2 in each color class.
(iv) Shows, together with what was just shown in (iii), that each color class is a
Hamilton cycle.
Hilton and Rodger [10] extended Theorem 4 to the complete multipartite graphs.
They proved the following result as a corollary of a much more general amalgamation
theorem.
Theorem 5 [10] Suppose that 2t ≤ s. Then, a k-edge-coloring of the complete t-

partite graph K a1 ,...,at can be embedded into a Hamiltonian decomposition of the
complete p-partite graph K (n, p, 0, 1) if and only if
(i) Each color class is a set of vertex-disjoint paths,
(i) ai ≤ n for 1 ≤ i ≤ t, and
(i) p(n − 1) is even.
The proof of Theorem 5, while more complicated, follows the approach outlined
above for proving Theorem 4. In this case, the given t-partite graph is first embedded
greedily into an edge-colored K (n, t, 0, 1) in which each color class is still a set of
vertex-disjoint paths; this can be done since we are assuming that 2t ≤ s. The second
step introduces one new vertex, an amalgamated vertex playing the role of α in the
outline of the proof of Theorem 4 above, but in this case the technique calls for all
vertices within the same part to be disentangled before moving on to vertices from
other parts still contained in α.
The embedding of edge-colored copies of K (n, t, λ1 , λ2 ) into Hamilton decom-
positions of K (n, p, λ1 , λ2 ) is really very interesting. Reasonably obvious numerical
conditions are sufficient when p is somewhat larger than t (see Theorem 6), but at this
stage it appears that there are conditions which depend upon the existence of certain
components in a companion bipartite graph to the given edge-colored graph which
are necessary for the embedding to exist (see Theorem 7). This structural property
is reminiscent of the long-standing unsolved embedding problem for partial idem-
potent latin squares of order n into idempotent latin squares of order n + t when t is
small: When t ≥ n numerical conditions do prove to be sufficient (see [11–13]), but
for smaller values of t the existence of certain components in a closely related graph
can prevent such an embedding (see [11, 14]).
As in other results mentioned so far, the following is a consequence of a more
general amalgamation result in [15] which requires some postulations that are un-
likely to be necessary in a complete solution to the problem. Nevertheless, the result
is sufficiently general to allow the embedding problem to be solved whenever the
number of parts, r , being added to the given edge-colored copy of K (n, t, λ1 , λ2 )
is large enough. It is always a little worrying when a result is described in terms of

some parameter being sufficiently large. Often that necessary size for the result to
work is really very large. However, the good news in this case is that in fact the lower
bound on r for the result to be applicable is not really so large, as the following result
indicates.
Theorem 6 [15] Let n > 1, λ1 ≥ 0, λ2 ≥ 1, λ1 = λ2 , p = t + r and
λ1 (n − 1) + λ2 n(t − 1)
r≥ . (1)
λ2 n(n − 1)
Then, a k-edge-coloring of K (n, t, λ1 , λ2 ) can be embedded into a Hamiltonian

decomposition of K (n, p, λ1 , λ2 ) if and only if

1. k = λ1 (n − 1) + λ2 n( p − 1) /2,
2. λ1 ≤ λ2 n( p − 1),
3. Every component of G( j) is a path (possibly of length 0) for 1 ≤ j ≤ k, and
4. G( j) has at most nr components for 1 ≤ j ≤ k.
In the same paper, using the same general amalgamation theorem, it turns out that
the case where r = 1 (so just one part is being added) can also be completely solved.
So now we need to explore the values of r between 1 and (λ1 (n − 1) + λ2 n(t −
1))/λ2 n(n − 1). Starting with the smallest values seems enticing! It turns out that
even just considering the case where r = 2 is particularly challenging. We appear to
enter a different world where the structure can play a deciding role in determining
whether or not the embedding of the k-edge-coloring of G = K (n, t, λ1 , λ2 ) into a
Hamiltonian decomposition of H = K (n, p = t + 2, λ1 , λ2 ) is possible. To see this,
it is best to describe the issue in terms of a related bipartite graph, B. Its vertex set is
of course partitioned into two sets: V (G) and C = {c j | 1 ≤ j ≤ k}. Each v ∈ V (G)
is joined to c j in B with x edges if and only if dG( j) (v) = 2 − x. Recall that in H
each color class is a Hamilton cycle, so each vertex has degree 2 in each color class.
So B is keeping a track of how many more edges of each color, j, that v needs
added during the embedding process. Connectivity is also a critical aspect of the
embedding: The added vertices in the r = 2 new parts need to be used to connect
up all the paths in G( j) for each color j (so 1 ≤ j ≤ k). For various reasons, it
seems likely, possibly even necessary, that if d B (c j ) ≡ 2 (mod 4) then at least one
of the components (paths) in G( j) must have its end vertices in G, say v j,1 and v j,2 ,
joined to different new parts in H . Reproducing this during a proof of the sufficiency
is managed by forming B ∗ , a modification of B constructed by disentangling such
c j into two vertices, one having degree 2 being adjacent to v j,1 and v j,2 . As the
embedding proceeds, choosing the path for each color, j, which determines v j,1 and
v j,2 seems to be critical, as is described in condition (∗) of Theorem 7 below. Let
= {{v j,1 , v j,2 } | 1 ≤ j ≤ k} describe this choice. It is conceivable that condition
(∗) is also a necessary condition. Let C2 denote the set of vertices in C of degree 2
(mod 4).
10 C. A. Rodger
Theorem 7 [16] Let n > 1, λ1 ≥ 0, λ2 ≥ 1 and λ1 = λ2 . Suppose we are given a

k-edge-coloring of G = K (n, t, λ1 , λ2 ), and that
(*) can be chosen such that in the detached graph, B ∗ , the number of components
having an odd number of color vertices of degree divisible by 4 is at most λ2 n 2 .
Then, the k-edge-coloring of G can be embedded into a Hamiltonian decomposition
of K (n, p = t + 2, λ1 , λ2 ) if and only if
of Theorem 6 with r = 2 are satisfied, and

(i) Conditions (1–4)
(v) |C2 | ≤ 2λ1 n2 + λ2 n 2 .
Apart from amalgamations, there is another aspect of the proof of this result which
is of interest here since a 2-edge-coloring of B ∗ is required that has the colors fairly
divided in two ways. An edge-coloring of a graph is said to be equitable at vertex v if,
for all colors i and j, the number of edges incident with v colored i is within 1 of the
number of edges colored j. An edge-coloring of a graph is said to be evenly equitable
at vertex v if, for all colors i and j, the number of edges incident with v colored i
is even and is within 2 of the number of edges colored j. Hilton [17] proved that
evenly equitable edge-colorings (i.e., evenly equitable at all vertices) exist whenever
all vertices have even degree. Equitable edge-colorings (i.e., equitable at all vertices)
are much more problematic (see [18] for example), but de Werra [19] has shown
that they always exist for bipartite graphs. To prove Theorem 7, it was critical that
these two results of Hilton and de Werra be generalized to require some vertices to
be evenly equitably colored and others to be equitably colored. We end with this
crucial lemma, which is of interest in its own right.
Lemma 1 [16] Let B be a finite even bipartite graph with bipartition {V, C} of its
vertex set. For any subset X ⊆ C, there exists a 2-edge-coloring σ : E(B) → {1, 2}
such that
(i) d B(1) (v) = d B(2) (v) for all v ∈ V ,
(ii) d B(1) (c) = d B(2) (c) for all c ∈ X , and
(iii) |d B(1) (c) − d B(2) (c)| = 2 for all c ∈ C \ X
if and only if
(iv) |V (D) ∩ (C \ X )| is even for each component D of B.
References
1. McDiarmid, C.J.H.: The solution of a timetabling problem. J. Inst. Math. Appl. 9, 23–34 (1972)
2. Hajnal, A., Szemerdi, E.: Proof of a Conjecture of P. Erdös, Combinatorial Theory and its
Applications, II North-Holland, Amsterdam, , pp. 601–623 (1970)
3. Lucas, E.: Récréations mathématiques, vol. 2, Gauthier-Villars, Paris (1883)
4. Hoffman, D.G., Rodger, C.A.: The chromatic index of complete multipartite graphs. J. Graph
Theor. 16, 159–163 (1992)
5. Lam, P., Shiu, W.C., Tong, C.S., Zhang, Z.F.: On the equitable chromatic number of complete
n-partite graphs. Discrete Appl. Math. 113, 307–310 (2001)
6. Laskar, R., Auerbach, B.: On decomposition of r -partite graphs into edge-disjoint Hamiltonian
circuits. Discrete Math. 14, 265–268 (1976)
7. Bahmanian, M.A., Rodger, C.: Multiply balanced edge colorings of multigraphs. J. Graph
Theor. 70, 297–317 (2012)
8. Hilton, A.J.W.: School timetables, studies on graphs and discrete programming. Ann. Discrete
Math. 11, 177–188 (1981)
9. Hilton, A.J.: Hamiltonian decompositions of complete graphs. J. Comb. Theor. (B) 36, 125–134
(1984)
10. Hilton, A.J., Rodger, C.A.: Hamiltonian decompositions of complete regular s-partite graphs.
Discrete Math. 58, 63–78 (1986)
11. Andersen, L.D., Hilton, A.J.W., Rodger, C.A.: A solution to the embedding problem for partial
idempotent Latin squares. J. London Math. Soc. 26, 21–27 (1982)
12. Rodger, C.A.: Embedding incomplete idempotent latin squares, Combinatorial Mathematics
X. Lecture Notes in Mathematics (Springer), vol. 1036, pp. 355–366 (1983)
13. Rodger, C.A.: Embedding an incomplete latin square in a latin square with a prescribed diag-
onal. Discrete Math. 51, 73–89 (1984)
14. Andersen, L.D., Hilton, A.J.W., Rodger, C.A.: Small embeddings of incomplete idempotent
Latin squares. Ann. Discrete Math. 17, 19–31 (1983)
15. Bahmanian, M.A., Rodger, C.: Embedding an edge-colored K (a ( p) ; λ, μ) into a Hamiltonian
decomposition of K (a ( p+r ) ; λ, μ). Graphs Comb. 29, 747–755 (2012)
16. Demir, M., Rodger, C.A.: Embedding an Edge-Coloring of K (nr ; λ1 , λ2 ) into a Hamiltonian
Decomposition of K (nr +2 ; λ1 , λ2 ), submitted
17. Hilton, A.J.W.: Canonical edge-colourings of locally finite graphs. Combinatorica 2, 37–51
(1982)
18. Hilton, A.J.W., de Werra, D.: A sufficient condition for equitable edge-colourings of simple
graphs. Discrete Math. 128, 179–201 (1994)
19. de Werra, D.: Equitable colorations of graphs, Rev. Franaise Informat. Recherche Oprationnelle
5, Sr. R-3, 3–8 (1971)
Chapter 2
On Strong Pseudomonotone
and Strong Quasimonotone Maps
Sanjeev Kumar Singh, Avanish Shahi and S. K. Mishra
Abstract We introduce strong pseudomonotone and strong quasimonotone maps

of higher order and establish their relationships with strong pseudoconvexity and
strong quasiconvexity of higher order, respectively, which yields first-order char-
acterizations of strong pseudoconvex and strong quasiconvex functions of higher
order. Moreover, we answer the open problem (converse part of Proposition 6.2) of
Karamardian and Schaible (J. Optim. Theory Appl. 66:37–46,1990), for even more
generalized functions, namely strongly pseudoconvex functions of higher order.
Keywords Generalized monotone maps · Generalized convexity · First-order

conditions
1 Introduction
Minty [9] introduced the concept of monotone maps. Further, in addition to that
Karamardian [5] discussed strict monotone and strongly monotone maps. It is well
known that every differentiable function is convex if and only if its gradient map
is monotone (see [2, 10]). Karamardian [5] stated the relationship between strongly
convex functions and strongly monotone maps. In 1976, Karamardian [4] introduced
the concept of pseudomonotone maps and showed that a differentiable pseudocon-
vex function (see [3, 8]) is characterized by pseudomonotonicity of its gradient
map and used monotonicity/pseudomonotonicity in establishing several existence
theorems for complementarity problems. Further, Karamardian and Schaible [6] in-
troduced strictly pseudomonotone, quasimonotone, strongly monotone, and strongly
S. K. Singh · A. Shahi · S. K. Mishra (B)

Department of Mathematics, Institute of Science, Banaras Hindu University,
Varanasi 221005, India
e-mail: bhu.skmishra@gmail.com
S. K. Singh
e-mail: sksingh20894@gmail.com
A. Shahi
e-mail: avanishshahi123@gmail.com
© Springer Nature Singapore Pte Ltd. 2018 13

D. Ghosh et al. (eds.), Mathematics and Computing, Springer Proceedings
in Mathematics & Statistics 253, https://doi.org/10.1007/978-981-13-2095-8_2
Another random document with
no related content on Scribd:
will sweep like a whirlwind from the lakes to the Gulf and from ocean
to ocean.”
Frye Nominating Blaine.
In the Chicago Convention, 1880.

“I once saw a storm at sea in the nighttime; an old ship battling for
its life with the fury of the tempest; darkness everywhere; the winds
raging and howling; the huge waves beating on the sides of the ship,
and making her shiver from stem to stern. The lightning was
flashing, the thunders rolling; there was danger everywhere. I saw at
the helm, a bold, courageous, immovable, commanding man. In the
tempest, calm; in the commotion, quiet; in the danger, hopeful. I saw
him take that old ship and bring her into her harbor, into still waters,
into safety. That man was a hero. [Applause.] I saw the good old ship
of State, the State of Maine, within the last year, fighting her way
through the same waves, against the dangers. She was freighted with
all that is precious in the principles of our republic; with the rights of
the American citizenship, with all that is guaranteed to the American
citizen by our Constitution. The eyes of the whole nation were on her,
and intense anxiety filled every American heart lest the grand old
ship, the “State of Maine,” might go down beneath the waves forever,
carrying her precious freight with her. But there was a man at the
helm, calm, deliberate, commanding, sagacious; he made even the
foolish man wise; courageous, he inspired the timid with courage;
hopeful, he gave heart to the dismayed, and he brought that good old
ship safely into harbor, into safety; and she floats to-day greater,
purer, stronger for her baptism of danger. That man too, was heroic,
and his name was James G. Blaine. [Loud cheers.]
“Maine sent us to this magnificent Convention with a memory of
her own salvation from impending peril fresh upon her. To you
representatives of 50,000,000 of the American people, who have
met here to counsel how the Republic can be saved, she says,
“Representatives of the people, take the man, the true man, the
staunch man, for your leader, who has just saved me, and he will
bring you to safety and certain victory.””
Senator Hill’s Denunciation of Senator
Mahone.
In Extra Session of the Senate, March 14, 1881.

Very well; the records of the country must settle that with the
Senator. The Senator will say who was elected as a republican from
any of the States to which I allude. I say what the whole world knows,
that there are thirty-eight men on this floor elected as democrats,
declaring themselves to be democrats, who supported Hancock, and
who have supported the democratic ticket in every election that has
occurred, and who were elected, moreover, by democratic
Legislatures, elected by Legislatures which were largely democratic;
and the Senator from New York will not deny it. One other Senator
who was elected, not as a democrat, but as an independent, has
announced his purpose to vote with us on this question. That makes
thirty-nine, unless some man of the thirty-eight who was elected by a
democratic Legislature proves false to his trust. Now, the Senator
from New York does not say that somebody has been bought. No; I
have not said that. He does not say somebody has been taken and
carried away. No; I have not said that. But the Senator has said, and
here is his language, and I hope he will not find it necessary to
correct it:
It may be said, very likely I shall be found to say despite some
criticism that I may make upon so saying in advance, that
notwithstanding the words “during the present session,” day after to-
morrow or the day after that, if the majority then present in the
Chamber changes, that majority may overthrow all this proceeding,
obliterate it, and set up an organization of the Senate in conformity
with and not in contradiction of the edict of the election.
The presidential election he was referring to—
If an apology is needed for the objection which I feel to that, it will
be found I think in the circumstance that a majority, a constitutional
majority of the Senate, is against that resolution, is against the
formation of committees democratic in inspiration and persuasion,
to which are to go for this session all executive matters.
The Senator has announced to-day that the majority on this side of
the Chamber was only temporary. He has announced over and over
that it was to be a temporary majority. I meet him on the fact. I say
there are thirty-eight members sitting in this Hall to-day who were
elected by democratic Legislatures, and as democrats, and one
distinguished Senator who was not elected as a democrat, but by
democratic votes, the distinguished Senator from Illinois, [Mr.
Davis,] has announced his purpose to vote with these thirty-eight
democrats. Where, then, have I misrepresented? If that be true, and
if those who were elected as democrats are not faithless to the
constituency that elected them, you will not have the majority when
the Senate is full.
Again, so far from charging the Senator from New York with being
a personal party to this arrangement, I acquitted him boldly and
fearlessly, for I undertake to say what I stated before, and I repeat it,
to his credit, he is no party to an arrangement by which any man
chosen by a democratic Legislature and as a democrat is not going to
vote for the party that sent him here. Sir, I know too well what
frowns would gather with lightning fierceness upon the brow of the
Senator from New York if I were to intimate or any other man were
to intimate that he, elected as a republican, because he happened to
have a controlling vote was going to vote with the democrats on the
organization. What would be insulting to him he cannot, he will not
respect in another.
Now, sir, I say the Senator has been unjust in the conclusion which
he has drawn, because it necessarily makes somebody who was
chosen as a democrat ally himself with the republicans, not on great
questions of policy, but on a question of organization, on a question
of mere political organization. I assume that that has not been done.
No man can charge that I have come forward and assumed that his
fidelity was in question. I have assumed that the Senator from New
York was wrong in his statement. Why? Because if any gentleman
who was chosen to this body as a democrat has concluded not to vote
with the democrats on the organization, he has not given us notice,
and I take it for granted that when a gentleman changes his opinions,
as every Senator has a right to change his opinions, his first duty is to
give notice of that change to those with whom he has been
associated. He has not given that notice; no democrat of the thirty-
eight has given that notice to this side of the House. I therefore
assume that no such change has occurred.
But there is another obligation. While I concede the right of any
gentleman to change his opinions and change his party affiliations,
yet I say that when he has arrived at the conclusion that duty
requires him to make that change he must give notice to the
constituency that sent him here. I have heard of no such notice. If the
people of any of these democratic States, who through democratic
Legislatures have sent thirty-eight democrats to this body and one
more by democratic votes, have received notice of a change of party
opinion or a change of party affiliations by any of those they sent
here, I have not heard of it; the evidence of it has not been produced.
Sir, I concede the right of every man to change his opinions; I
concede the right of every man to change his party affiliations; I
concede the right of any man who was elected to the high place of a
seat in this Senate as a democrat to change and become a republican;
but I deny in the presence of this Senate, I deny in the hearing of this
people, that any man has a right to accept a commission from one
party and execute the trust confided to him in the interest of another
party. Demoralized as this country has become, though every wind
bears to us charges of fraud and bargain and corruption; though the
highest positions in the land, we fear, have been degraded by being
occupied by persons who procured them otherwise than by the
popular will, yet I deny that the people of either party in this country
have yet given any man a right to be faithless to a trust. They have
given no man a right to accept a commission as a democrat and hold
that commission and act with the republicans. Manhood, bravery,
courage, fidelity, morality, respect for the opinions of mankind
requires that whenever a man has arrived at the conclusion that he
cannot carry out the trust which was confided to him, he should
return the commission and tell his constituents, “I have changed my
mind and therefore return you the commission you gave me.” Sir, I
do not believe that a single one of the thirty-eight gentlemen who
were elected as democrats and whose names are before me here, will
hold in his pocket a commission conferred by democrats, conferred
on him as a democrat, and without giving notice to his constituency,
without giving notice to his associates, will execute that commission
in the interest of the adversary party and go and communicate his
conclusion, first of all, and only, to the members of the adversary
party.
Sir, who is it that has changed? Whom of these thirty-eight does
the Senator rely upon to vote with the republicans? That one has not
notified us; he has not notified his constituency. Therefore I say it is
not true, and I cannot sit here quietly and allow a gentleman on the
other side of the Chamber, however distinguished, to get up here and
assume and asseverate over and over that somebody elected as a
democrat is faithless to his trust, and not repel it. No, gentlemen, you
are deceived; you will be disappointed. I vindicate the character of
American citizenship, I vindicate the honor of human nature when I
say you will be disappointed, and no man elected as a democrat is
going to help you organize the committees of this Senate. I do not say
so because I know. No, I have no personal information, but I will
stand here and affirm that no man who has been deemed by any
constituency in this country to be worthy of a place in this body will
be guilty of that treachery. And how is the Senator’s majority to
come? How many are there? He has not told us. The papers said this
morning that there were two or three, and they named my good
friend from Tennessee, [Mr. Harris.] When I saw that I knew the
whole thing was absurd. The idea that anybody in this world would
ever believe that my friend from Tennessee could possibly be guilty
of such a thing, and my colleague [Mr. Brown] also was named—
gentlemen who were born and reared in the school of fidelity to their
party. How many? Have you one? If you have but one that was
elected as a democrat and who has concluded to go with the
republicans, then you have only half, you have 38 to 38, and I
suppose you count upon the vote of the Vice-President. Has that
been arranged? Sir, I will not blame you if you vote for voting
according to the sentiment that elected you, for voting according to
the professions of your principles which you avowed when you were
elected. I deny myself the right of the Vice-President to take part in
the constitution and organization of this Senate; but I shall not make
the question. If you have got one, the vote will be 38 to 38. Who is
the one? Who is ambitious to do what no man in the history of this
country has ever done, to be the first man to stand up in this high
presence, after this country has reached fifty million people, and
proclaim from this proud eminence that he disgraces the commission
he holds. [Applause in the galleries.]
The Vice-President rapped to order.
Mr. Hill, of Georgia. Who is it? Who can he be? Do you receive
him with affection? Do you receive him with respect? Is such a man
worthy of your association? Such a man is not worthy to be a
democrat. Is he worthy to be a republican? If my friend from Illinois,
my friend from Kansas, or my friend from New York, were to come to
me holding a republican commission in his pocket, sent here by a
republican Legislature, and whisper to me “I will vote with the
democrats on organization,” I would tell him that if he so came he
would be expelled with ignominy from the ranks of the party.
And why do you beg us to wait? If all who were elected as
democrats are to remain democrats, what good will waiting do you?
You will still be in a minority of two, the same minority you are in
this morning.
Mr. President, I affirm that no man elected and sent here by a
democratic Legislature as a democrat, whatever may have been local
issues, whatever may have been the divisions of factions, and above
all no man who professed to be a democrat when he was elected and
who procured his election by professing to be a democrat, in the
name of democracy and republicanism as well, in the name of
American nature, I charge that no such man will prove false to his
trust; and therefore why wait? Why delay the business of the
country? Why should the nominations lie on the table unacted on?
Why should we spend days and days here with the parties on the
other side filibustering for time to get delay, to get a few days? Why
should we do that when upon the assumption that the Senate is not
to blush at an exhibition of treachery the result will be the same one
week, two weeks, six months, two years from now that it is now?
Sir, I know that there is a great deal in this question. The American
people have had much to humiliate them; all peoples have much to
humiliate them. I know that the patronage of this Government has
become very great. I know that the distinguished gentleman who
presides at the other end of the Avenue holds in his hand millions
and hundreds of millions of patronage. To our shame be it said it has
been whispered a hundred times all through the country by the
presses of both parties until it has become absolutely familiar to
American ears that the patronage of the Federal Government has
been used to buy votes and control elections to keep one party in
power. It is a question that confronts every honest statesman
whether something shall not be done to lessen that patronage. I
respond to the sentiment of the President in his inaugural when I say
there ought to be a rule in even the civil service by which this
patronage shall be placed where it cannot be used for such purposes.
If it is not done, I do not know what humiliations are in store for us
all.
But, Mr. President, here are facts that no man can escape.
Gentlemen of the republican party of this Senate, you cannot
organize the Senate unless you can get the vote of some man who
was elected as a democrat. You cannot escape that. Have you gotten
it? If so, how? If you have, nobody knows it but yourselves. How?
There is no effect without a cause; there is no change without a
purpose; there is no bargain without a consideration. What is the
cause? If there has been a change, why a change? How does it
happen that you know the change and we do not? What induced the
change? I deny that there has been a change. I maintain that all the
distinguished gentlemen who make up the thirty-eight democrats on
this side of the Chamber are firm, firm to the principles that sent
them here, firm to the professions that sent them here, and firm to
the constituencies that sent them here. They were elected as
democrats. Now on the question of organization, which is nothing in
the world but a pure political question and a party question at that,
they will act with the democratic party, and you, gentlemen, will be
deceived if you calculate otherwise. Therefore, there is no necessity
for you to enter into all this filibustering and producing this delay for
the purpose of getting the organization.
Mr. President, as I said before, the Senate should be a place where
there should be no masquerading; men should deal frankly with each
other. If I were to charge any gentleman on the republican side of the
Chamber who was elected as a republican, who professed to be a
republican when he was elected, with having made arrangements
with the democrats to vote with them, I should insult him and he
would resent it as an insult, and gentlemen excuse me for repelling
the charge which if made against you, you would repel as an insult. I
repel as an insult the charge made against any democrat that he
would be false to his colors and is intending to vote with you on the
organization.
Mr. Harris. Mr. President, I rise only to say that I regret that the
honorable Senator from Georgia should have deemed it proper to
dignify the miserable newspaper twaddle in respect to my political
position——
Mr. Hill, of Georgia. I will say to my friend I did not intend——
Mr. Harris. I am quite sure the Senator did not intend anything
unkind to me; yet, by mentioning the matter here, he gives a dignity
to it that it never could have had otherwise, and one that it is not
worthy of, especially in view of the fact, as I very well know, that
there is not a democrat or a republican in America, who knows me,
who has ever doubted, or doubts to-day, what my political position
is. It is unworthy of further notice, and I will notice it no more.
Mr. Mahone. Mr. President, I do not propose to detain you and
the Senate more than a few minutes. The distinguished Senator from
Georgia has manifestly engaged in an effort to disclose my position
on this floor.
Mr. Hill, of Georgia. I do not know what your position is. How
could I disclose it?
Mr. Mahone. Sir, the Senator might be a little more direct as he
might well have been in the course of his remarks in asking my
position; and that I will give him.
Now, Mr. President, the Senator has assumed not only to be the
custodian here of the democratic party of this nation, but he has
dared to assert his right to speak for a constituency that I have the
privilege, the proud and honorable privilege on this floor, of
representing [applause in the galleries] without his assent, without
the assent of such democracy as that he speaks for. [Applause in the
galleries.] I owe them, sir, I owe you [addressing Mr. Hill] and those
for whom you undertake to speak nothing in this Chamber.
[Applause in the galleries.] I came here, sir, as a Virginian to
represent my people, not to represent that democracy for which you
stand. [Applause in the galleries.] I come with as proud a claim to
represent that people as you to represent the people of Georgia, won
on fields where I have vied with Georgians whom I commanded and
others in the cause of my people and of their section in the late
unhappy contest; but thank God for the peace and the good of the
country that contest is over, and as one of those who engaged in it,
and who has neither here nor elsewhere any apology to make for the
part taken, I am here by my humble efforts to bring peace to this
whole country, peace and good will between the sections, not here as
a partisan, not here to represent that Bourbonism which has done so
much injury to my section of the country. [Applause in the galleries.]
Now, sir, the gentleman undertakes to say what constitutes a
democrat. A democrat! I hold, sir, that to-day I am a better democrat
than he, infinitely better—he who stands nominally committed to a
full vote, a free ballot, and an honest count. I should like to know
how he stands for these things where tissue ballots are fashionable.
[Laughter, and applause in the galleries.]
Now, sir, I serve notice on you that I intend to be here the
custodian of my own democracy. I do not intend to be run by your
caucus. I am in every sense a free man here. I trust I am able to
protect my own rights and to defend those of the people whom I
represent, and certainly to take care of my own. I do not intend that
any Senator on this floor shall undertake to criticise my conduct by
innuendoes, a method not becoming this body or a straightforward
legitimate line of pursuit in argument.
I wish the Senator from Georgia to understand just here that we
may get along in the future harmoniously, that the way to deal with
me is to deal directly. We want no bills of discovery. Now, sir, you
will find out how I am going to vote in a little while. [Applause.]
Mr. Davis, of West Virginia. Mr. President, during this temporary
suspension——
Mr. Mahone. I have not yielded the floor. I am waiting for a little
order.
Mr. Davis, of West Virginia. I wish to call the attention of the Chair
to the disorder in the Senate both when my friend from Georgia was
speaking and now. I believe it has been some time since we have had
as much disorder as we have had to-day in the galleries. I hope the
Chair will enforce order.
Mr. Teller. I should like to say that much of the disorder
originated in the first place from the cheering on the democratic side
of the Chamber.
The Vice-President. The Chair announces that order must be
maintained in the galleries; otherwise the Sergeant-at-Arms will be
directed to clear the galleries.
Mr. Mahone. I promised not to detain the Senate, and I regret that
so early after my appearance here I should find it necessary to
intrude any remarks whatsoever upon the attention of this body. I
would prefer to be a little modest; I would prefer to listen and to
learn; but I cannot feel content after what has passed in this
presence, when the gentleman by all manner of methods, all manner
of insinuations, direct and indirect, has sought to do that which
would have been better done and more bravely pursued if he had
gone directly to the question itself. He has sought to discover where
the democrat was who should here choose to exercise his right to cast
his vote as he pleased, who should here exercise the liberty of
manhood to differ with his caucus. Why, sir, the gentleman seems to
have forgotten that I refused positively to attend his little lovefeast;
not only that, I refused to take part in a caucus which represents a
party that has not only waged war upon me but upon those whom I
represent on this floor. They have not only intruded within the
boundaries of my own State, without provocation, to teach honesty
and true democracy, but they would now pursue my people further
by intruding their unsolicited advice and admonition to their
representative in this Chamber. Yes, sir, you have been notified, duly
notified that I would take no part or lot in any political machinery.
Further than that, you have been notified that I was supremely
indifferent to what you did; that I had no wish to prefer, and was
indifferent to your performances; that I should stand on this floor
representing in part the people of the State of Virginia, for whom I
have the right to speak (and not the Senator from Georgia) even of
their democracy. The gentleman may not be advised that the
Legislature which elected me did not require that I should state
either that I was a democrat or anything else. I suppose he could not
get here from Georgia unless he was to say that he was a democrat,
anyhow. [Laughter.] I come here without being required to state to
my people what I am. They were willing to trust me, sir, and I was
elected by the people, and not by a legislature, for it was an issue in
the canvass. There was no man elected by the party with which I am
identified that did not go to the Legislature instructed by the
sovereigns to vote for me for the position I occupy on this floor. It
required no oath of allegiance blindly given to stand by your
democracy, such as is, [laughter,] that makes a platform and
practices another thing. That is the democracy they have in some of
the Southern States.
Now, I hope the gentleman will be relieved. He has been
chassezing all around this Chamber to see if he could not find a
partner somewhere; he has been looking around in every direction;
occasionally he would refer to some other Senator to know exactly
where the Senator was who stood here as a democrat that had the
manhood and the boldness to assert his opinions in this Chamber
free from the dictation of a mere caucus. Now, I want the gentleman
to know henceforth and forever here is a man, sir, that dares stand
up [applause] and speak for himself without regard to caucus in all
matters. [Applause, long continued, in the galleries and on the floor.]
Mr. President, pardon me; I have done.
Mr. Hill, of Georgia. Mr. President—
The Vice-President. The Senate will be in order. Gentlemen on
the floor not members of the Senate will take seats.
Mr. Hill, of Georgia. Mr. President, I hope nobody imagines that I
rise to make any particular reply to the remarkable exhibition we
have just seen. I rise to say a few things in justification of myself. I
certainly did not say one word to justify the gentleman in the
statement that I made an assault upon him, unless he was the one
man who had been elected as a democrat and was not going to vote
with his party. I never saw that gentleman before the other day. I
have not the slightest unkind feeling for him. I never alluded to him
by name; I never alluded to his State; and I cannot understand how
the gentleman says that I alluded to him except upon the rule laid
down by the distinguished Senator from New York, that a guilty
conscience needs no accuser. [Applause and hisses in the galleries.] I
did not mention the Senator. It had been stated here by the Senator
from New York over and over that the other side would have a
majority when that side was full. I showed it was impossible that they
should have a majority unless they could get one democratic vote,
with the vote of the Vice-President. I did not know who it was; I
asked who it was; I begged to know who it was; and to my utter
astonishment the gentleman from Virginia comes out and says he is
the man.
The Senator from Virginia makes a very strange announcement.
He charged me not only with attacking him, but with attacking the
people of Virginia? Did I say a word of the people of Virginia? I said
that the people of no portion of this country would tolerate treachery.
Was that attacking the people of Virginia? I said that thirty-eight
men had been elected to this body as democrats. Does the Senator
deny that? Does he say he was elected here not as a democrat? He
says he was not required to declare that he was a democrat, and in
the next breath he says he is a truer, better democrat than I am. Then
I commend him to you. Take good care of him, my friends. Nurse
him well. How do you like to have a worse democrat than I am?
Mr. Conkling and others. A better democrat.
Mr. Hill, of Georgia. Oh, a better! Then my friend from New York
is a better democrat than I am. You have all turned democrats; and
we have in the United States Senate such an exhibition as that of a
gentleman showing his democracy by going over to the Republicans!
Sir, I will not defend Virginia. She needs no defense. Virginia has
given this country and the world and humanity some of the brightest
names of history. She holds in her bosom to-day the ashes of some of
the noblest and greatest men that ever illustrated the glories of any
country. I say to the Senator from Virginia that neither Jefferson, nor
Madison, nor Henry, nor Washington, nor Leigh, nor Tucker, nor
any of the long list of great men that Virginia has produced ever
accepted a commission to represent one party and came here and
represented another. [Applause on the floor and in the galleries.]
Mr. Cockrell. I trust that those at least who are enjoying the
privilege of the floor of the Senate Chamber will be prohibited from
cheering.
The Vice-President. The Chair will state that the violation of the
rules does not appear to be in the galleries, but by persons who have
been admitted to the privilege of the floor. The Chair regrets to clear
the floor, but if the manifestation is continued he will be obliged to
do so. It is a violation of the rules of the Senate.
Mr. Mahone rose.
Mr. Hill, of Georgia. Does the Senator from Virginia wish to
interrupt me?
Mr. Mahone. I do wish to interrupt you.
The Vice-President. Does the Senator from Georgia yield?
Mr. Hill, of Georgia. Certainly.
Mr. Mahone. I understand you to say that I accepted a
commission from one party and came here to represent another. Do I
understand you correctly?
Mr. Hill, of Georgia. I understood that you were elected as a
democrat.
Mr. Mahone. Never mind; answer the question.
Mr. Hill, of Georgia. Yes, I say you accepted a commission, having
been elected as a democrat. That is my information.
Mr. Mahone. I ask you the question: Did you say that I had
accepted a commission from one party and came here to represent
another? That is the question.
Mr. Hill, of Georgia. Oh, I said that will be the case if you vote
with the republicans. You have not done it yet, and I say you will not
do it.
Mr. Mahone. If not out of order in this place, I say to the
gentleman that if he undertakes to make that statement it is
unwarranted and untrue.
Mr. Hill, of Georgia. I should like to ask the gentleman a
question: Was he not acting with the democratic party, and was he
not elected as a democrat to this body? Answer that question.
Mr. Mahone. Quickly, sir. I was elected as a readjuster. Do you
know what they are? [Laughter and applause.]
The Vice-President rapped with his gavel.
Mr. Hill, of Georgia. I understand there are in Virginia what are
called readjuster democrats and debt-paying democrats, or
something of that kind, but as I understand they are all democrats.
We have nothing to do with that issue. We are not to settle the debt
of Virginia in the Senate Chamber; but I ask the Senator again, was
he not elected to this body as a member of the national democratic
party?
Mr. Mahone. I will answer you, sir. No. You have got the answer
now.
Mr. Hill, of Georgia. Then I conceive that the gentleman spoke
truly when he said that I do not know what he is. What is he?
Everybody has understood that he voted with the democrats. Did he
not support Hancock for the Presidency? Did not the Senator
support Hancock for the Presidency, I ask him? [A pause] Dumb!
Did he not act with the democratic party in the national election, and
was not the Senator from Virginia himself a democrat? That is the
question. Why attempt to evade? Gentlemen, I commend him to you.
Is there a man on that side of the Chamber who doubts that the
Senator was sent to this body as a democrat? Is there a man in this
whole body who doubts it? Is there a man in Virginia who doubts it?
The gentleman will not deny it. Up to this very hour it was not known
on this side of the Chamber or in the country how he would vote in
this case, or whether he was still a democrat or not. I maintain that
he is. The Senator from New York seemed to have information that
somebody who was elected as a democrat was not, and I went to
work to find out who it was. It seems I have uncovered him. For
months the papers of the country have been discussing and debating
how the Senator would vote. Nobody could know, nobody could tell,
nobody could guess. I have been a truer friend to the Senator than he
has been to himself. I have maintained always that when it came to
the test the Senator would be true to his commission; that the
Senator would be true to the democratic professions he made when
he was elected. He will not rise in this presence and say he could
have been elected to the Senate as a republican. He will not rise in
the Senate and say he could have been elected to the Senate if he had
given notice that on the organization of this body he would vote with
the republicans. He will not say it.
The gentleman makes some remarks about the caucus. I have no
objection to a gentleman remaining out of a caucus. That is not the
question. I have no objection to a gentleman being independent.
That is not the question. I have no objection to a gentleman being a
readjuster in local politics. That is not the question. I have no
objection to a man dodging from one side to another on such a
question. With that I have nothing to do. That is a matter of taste
with him; but I do object to any man coming into this high council,
sent here by one sentiment, commissioned by one party, professing
to be a democrat, and after he gets here acting with the other party. If
the gentleman wants to be what he so proudly said, a man, when he
changes opinions, as he had a right to do, when he changes party
affiliations as he had a right to do, he should have gone to the people
of Virginia and said, “You believed me to be a democrat when you
gave me this commission; while I differed with many of you on the
local question of the debt, I was with you cordially in national
politics; I belonged to the national democratic party; but I feel that it
is my duty now to co-operate with the republican party, and I return
you the commission which you gave to me.” If the gentleman had
done that and then gone before the people of Virginia and asked
them to renew his commission upon his change of opinion, he would
have been entitled to the eulogy of manhood he pronounced upon
himself here in such theatrical style. I like manhood.
I say once more, it is very far from me to desire to do the Senator
injury. I have nothing but the kindest feelings for him. He is very
much mistaken if he supposes I had any personal enmity against
him. I have not the slightest. As I said before, I never spoke to the
gentleman in my life until I met him a few days ago; but I have done
what the newspapers could not do, both sides having been engaged
in the effort for months; I have done what both parties could not do,
what the whole country could not do—I have brought out the Senator
from Virginia.
But now, in the kindest spirit, knowing the country from which the
honorable Senator comes, identified as I am with its fame and its
character, loving as I do every line in its history, revering as I do its
long list of great names, I perform the friendly office unasked of
making a last appeal to the honorable Senator, whatever other fates
befall him, to be true to the trust which the proud people of Virginia
gave him, and whoever else may be disappointed, whoever else may
be deceived, whoever else may be offended at the organization of the
Senate, I appeal to the gentleman to be true to the people, to the
sentiment, to the party which he knows commissioned him to a seat
in this body.
Mr. Logan. Mr. President, I have but a word to say. I have listened
to a very extraordinary speech. The Senate of the United States is a
body where each Senator has a right to have a free voice. I have never
known before a Senator, especially a new Senator, to be arraigned in
the manner in which the Senator from Virginia has been, and his
conduct criticised before he had performed any official act, save one,
so far as voting is concerned. He needs no defense at my hands; he is
able to take care of himself; but I tell the Senator from Georgia when
he says to this country that no man has a right to come here unless
he fulfills that office which was dictated to him by a party, he says
that which does not belong to American independence. Sir, it takes
more nerve, more manhood, to strike the party shackles from your
limbs and give free thought its scope than any other act that man can
perform. The Senator from Georgia himself, in times gone by, has
changed his opinions. If the records of this country are true (and he
knows whether they are or not) he, when elected to a convention as a
Union man, voted for secession. [Applause in the galleries.]
The Vice-President rapped with his gavel.
Mr. Hoar. If my friend will pardon me a moment, I desire to call
the attention of the Chair to the fact that there has been more
disorder in this Chamber during this brief session of the Senate than
in all the aggregate of many years before. I take occasion when a
gentleman with whose opinions I perfectly agree myself in speaking
to say that I shall move the Chair to clear any portion of the gallery
from which expressions of applause or dissent shall come if they
occur again.
Mr. Logan. What I have said in reference to this record I do not
say by way of casting at the Senator, but merely to call attention to
the fact that men are not always criticised so severely for changing
their opinions. The Senator from Georgia spoke well of my colleague.
Well he may. He is an honorable man and a man deserving well of all
the people of this country. He was elected not as a democrat but by
democratic votes. He votes with you. He never was a democrat in his
life; he is not to-day. You applaud him and why? Because he votes
with you. You want his vote; that is all. You criticise another man
who was elected by republican votes and democratic votes,
readjusters as they are called, and say that he has no right to his
opinions in this Chamber. The criticism is not well. Do you say that a
man shall not change his political opinions?
The Senator from Georgia in days gone by, in my boyhood days, I
heard of, not as a democrat. To-day he sits here as a democrat. No
one wishes to criticise him because he has changed his political
opinions. He had a right to do so. I was a democrat once, too, and I
had a right to change my opinions and I did change them. The man
who will not change his opinions when he is honestly convinced that
he was in error is a man who is not entitled to the respect of men. I
say this to the Senator from Georgia. The Senator says to us, “take
him,” referring to the Senator from Virginia. Yes, sir, we will take
him if he will come with us, and we will take every other honest man
who will come. We will take every honest man in the South who
wants to come and join the republican party, and give him the right
hand of fellowship, be he black or white. Will you do as much?
Mr. Hill of Georgia. We have got them already.
Mr. Logan. Yes, and if a man happens to differ with you the
tyranny of political opinion in your section of country is such that
you undertake to lash him upon the world and try to expose him to
the gaze of the public as a man unfaithful to his trust. We have no
such tyranny of opinion in the country where I live; and it will be
better for your section when such notions are driven to the shades
and retired from the action of your people.
I do not know that the gentleman from Virginia intends to vote as
a republican. I have never heard him say so. I know only what he has
said here to-day; but I respect him for stating to the Senate and the
country that he is tired of the Bourbon democracy; and if more men
were tired of it the country would be better off. The people are
getting tired of it even down in your country, every where. The
sooner we have a division down there the better it will be for both
sides, for the people of the whole country.
I did not rise to make any defense of the Senator from Virginia, for
he is able, as I said, to defend himself, but merely to say to the
Senator from Georgia that the criticism made upon that Senator
without any just cause is something I never witnessed before in this
Chamber or in any other deliberative body, and in my judgment it
was not justified in any way whatever.
Mr. Hill, of Georgia. I desire to say once more, what everybody in
the audience knows is true, that I did not arraign the Senator from
Virginia. In the first speech I never alluded to Virginia or to the
Senator from Virginia.
Mr. Logan. Every one in the Chamber knew to whom the Senator
alluded.
Mr. Hill, of Georgia. I alluded to somebody who was elected as a
democrat, and who was going to vote as a republican.
Mr. Teller. He was not elected as a democrat.
Mr. Hill, of Georgia. Then I did not allude to the Senator from
Virginia.
Mr. Teller. The Senator said that thirty-eight members of the
Senate were elected as democrats.
Mr. Hill, of Georgia. Certainly they were.
Mr. Teller. That is a mistake.
Mr. Hill, of Georgia. Certainly they were, and the record shows it.
Mr. Conkling. May I ask the Senator a question?
Mr. Hill, of Georgia. Let me go on and then you can follow me. I
again say it is strange that the Senator from Virginia should say I
arraigned him, and his valiant defender, the Senator from Illinois,
comes to defend him from an arraignment that was never made.
Mr. Logan. Did not the Senator from Georgia ask the Senator from
Virginia in his seat if he was not elected as a Democrat? Did not the
Senator charge that a man was acting treacherously to his
constituents? Did the Senator not make the most severe arraignment
of him that he could possibly make?
Mr. Hill, of Georgia. If the Senator will allow me, I did that only
after the Senator from Virginia had arraigned himself. The Senator
from Virginia insisted that I alluded to him when I had not called his
name, and I had not alluded to his State and when I had arraigned
nobody.
Mr. Logan. Will the Senator allow me to ask him this question:
Did he not have in his mind distinctly the Senator from Virginia
when he made his insinuations?
Mr. Hill, of Georgia. I will answer the gentleman’s question fairly.
I did believe that the gentlemen on the other side who were counting

Textbook Mathematics and Computing Icmc 2018 Varanasi India January 9 11 Selected Contributions Debdas Ghosh Ebook All Chapter PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Textbook Mathematics and Computing Icmc 2018 Varanasi India January 9 11 Selected Contributions Debdas Ghosh Ebook All Chapter PDF

Uploaded by

Copyright:

Available Formats

Mathematics and Computing ICMC 2018

Varanasi India January 9 11 Selected

Mathematics and Computing Debdas Ghosh

Security and Privacy Second ISEA International

Applications of Computing and Communication

Advances in Digital Forensics XVI 16th IFIP WG 11 9

Mathematical Analysis and Applications in Modeling

Distributed Computing and Internet Technology 16th

Communication, Networks and Computing: First

Communication and computing systems : proceedings of

Debdas Ghosh · Debasis Giri

More information about this series at http://www.springer.com/series/10533

Ram N. Mohapatra Kouichi Sakurai

Ekrem Savas Tanmoy Som

Mathematics and Computing

ISSN 2194-1009 ISSN 2194-1017 (electronic)

Library of Congress Control Number: 2018950828

Mathematics Subject Classiﬁcation (2010): 35-xx, 65-xx, 76-xx, 90-xx, 94-xx

© Springer Nature Singapore Pte Ltd. 2018

The Fourth International Conference on Mathematics and Computing (ICMC—

pathogens with basic SIR model, diffusion equation, the Fisher–Kolmogoroff

Varanasi, India Prof. Tanmoy Som

1 Constructions and Embeddings of Hamilton Decompositions

10 A Solid Transportation Problem with Additional Constraints

21 A Fuzzy Random Continuous (Q, r, L) Inventory Model

33 A Uniformly Convergent NIPG Method for a Singularly

Rachid Ait Maalem Lahcen Department of Mathematics, University of Central

Manjusha P. Gandhi Department of Mathematics, Yeshwantrao Chavan College

Manish Kumar Department of Mathematics, Birla Institute of Technology and

Swaraj Paul Department of Mathematics, Visva Bharati, Santiniketan, West

Karthikeyan Subbiah Department of Computer Science, Institute of Science

Abstract In this paper, a discussion of the use of amalgamations in constructing

Keywords Hamilton cycles · Amalgamations · Fair edge-colorings · Embeddings

Colorings of graphs are very useful in a variety of settings, especially scheduling

© Springer Nature Singapore Pte Ltd. 2018 1

amalgamation proofs, but is also motivated by applications in the following sense.

2 Amalgamations and Hamilton Decompositions

the amalgamation (homomorphic image) of H = K (n, p, λ1 , λ2 ): For each of the

3 Embeddings of Edge-Colorings into Hamilton

In the previous section, Hilton’s paper [9] introducing amalgamations as a means

Theorem 4 [9] A k-edge-colored K n (some colors may appear on no edges) can

Theorem 5 [10] Suppose that 2t ≤ s. Then, a k-edge-coloring of the complete t-

is large enough. It is always a little worrying when a result is described in terms of

Theorem 6 [15] Let n > 1, λ1 ≥ 0, λ2 ≥ 1, λ1 = λ2 , p = t + r and

Then, a k-edge-coloring of K (n, t, λ1 , λ2 ) can be embedded into a Hamiltonian

Theorem 7 [16] Let n > 1, λ1 ≥ 0, λ2 ≥ 1 and λ1 = λ2 . Suppose we are given a

of Theorem 6 with r = 2 are satisfied, and

Sanjeev Kumar Singh, Avanish Shahi and S. K. Mishra

Abstract We introduce strong pseudomonotone and strong quasimonotone maps

Keywords Generalized monotone maps · Generalized convexity · First-order

S. K. Singh · A. Shahi · S. K. Mishra (B)

© Springer Nature Singapore Pte Ltd. 2018 13

In the Chicago Convention, 1880.

In Extra Session of the Senate, March 14, 1881.

You might also like