Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Springer Nature Link |
|---|---|
| Author | Zemanian, A.H. |
| Copyright Year | 2004 |
| Abstract | The theory of transfinite graphs developed so far has been based on the ideas that connectedness is accomplished through paths and that the infinite extremities of the graph are specified through one-way infinite paths. As a result, a variety of difficulties arise in that theory, leading to the need to restrict such path-based graphs in various ways to obtain certain results. In this work, we present a more general theory of transfinite graphs, wherein connectedness and the designation of extremities are accomplished through walks rather than paths. This leads to a simpler and yet more general theory, wherein new kinds of transfinite extremities are also encompassed. For instance, an ordinal-valued distance function can now be defined on all pairs of walk-connected nodes, in contrast to the path-based theory, wherein no distance function is definable for those pairs of nodes that are not path connected even though they are walk connected. Some results concerning eccentricities, radii, and diameters are presented in this more general walk-based graph theory. Another new result herein is the development of an electrical network theory for networks whose graphs are walk based. A unique voltage-current regime is established under certain conditions. The current regime is built up from current flows in closed transfinite walks—in contrast to a prior theory based upon flows in transfinite loops. A notable advantage of the present approach is that node voltages with respect to a given ground node are always unique whenever they exist. The present approach is more general in that it provides nontrivial voltage-current regimes for certain networks for which the prior approach would only provide trivial solutions having only zero currents and voltages everywhere. |
| Starting Page | 1 |
| Ending Page | 31 |
| Page Count | 31 |
| File Format | |
| ISSN | 0278081X |
| Journal | Circuits, Systems, and Signal Processing |
| Volume Number | 23 |
| Issue Number | 1 |
| e-ISSN | 15315878 |
| Language | English |
| Publisher | Birkhäuser-Verlag |
| Publisher Date | 2004-01-01 |
| Publisher Place | Boston |
| Access Restriction | One Nation One Subscription (ONOS) |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Signal Processing |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|